./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-179.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:12,014 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:12,092 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edd02e3e-1b0f-4b63-abc3-37df1e308125/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:12,097 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:12,097 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:12,123 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:12,124 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:12,124 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:12,124 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:12,125 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:12,125 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:12,125 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:12,125 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:12,125 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:12,125 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:12,126 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:12,126 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:12,126 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:12,126 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:12,126 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:12,127 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:12,127 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:12,127 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:12,127 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:12,127 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:12,128 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:12,128 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:12,521 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:12,534 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:12,537 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:12,539 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:12,540 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:12,543 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edd02e3e-1b0f-4b63-abc3-37df1e308125/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-179.smt2
[2025-04-28 21:21:12,546 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:12,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:12,881 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edd02e3e-1b0f-4b63-abc3-37df1e308125/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-179.smt2
[2025-04-28 21:21:12,885 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:12,887 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:12,888 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:12,888 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:12,888 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:12,895 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:12,934 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12 Unit
[2025-04-28 21:21:12,938 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:12,940 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:12,940 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:12,940 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:12,960 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:12,961 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,001 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,002 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,006 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,010 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,018 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,020 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,021 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,045 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:13,048 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:13,049 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:13,049 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:13,050 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (1/1) ...
[2025-04-28 21:21:13,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:13,077 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:13,094 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:13,098 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:13,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:13,116 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:13,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:13,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main given in one single declaration
[2025-04-28 21:21:13,117 INFO  L130     BoogieDeclarations]: Found specification of procedure %main
[2025-04-28 21:21:13,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main
[2025-04-28 21:21:13,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.1 given in one single declaration
[2025-04-28 21:21:13,117 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.1
[2025-04-28 21:21:13,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.1
[2025-04-28 21:21:13,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.6 given in one single declaration
[2025-04-28 21:21:13,117 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.6
[2025-04-28 21:21:13,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.6
[2025-04-28 21:21:13,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.9 given in one single declaration
[2025-04-28 21:21:13,118 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.9
[2025-04-28 21:21:13,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.9
[2025-04-28 21:21:13,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.14 given in one single declaration
[2025-04-28 21:21:13,118 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.14
[2025-04-28 21:21:13,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.14
[2025-04-28 21:21:13,120 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.17 given in one single declaration
[2025-04-28 21:21:13,120 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.17
[2025-04-28 21:21:13,120 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.17
[2025-04-28 21:21:13,121 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.22 given in one single declaration
[2025-04-28 21:21:13,121 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.22
[2025-04-28 21:21:13,121 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.22
[2025-04-28 21:21:13,122 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.25 given in one single declaration
[2025-04-28 21:21:13,122 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.25
[2025-04-28 21:21:13,122 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.25
[2025-04-28 21:21:13,123 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.30 given in one single declaration
[2025-04-28 21:21:13,123 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.30
[2025-04-28 21:21:13,123 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.30
[2025-04-28 21:21:13,123 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.33 given in one single declaration
[2025-04-28 21:21:13,123 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.33
[2025-04-28 21:21:13,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.33
[2025-04-28 21:21:13,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.38 given in one single declaration
[2025-04-28 21:21:13,124 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.38
[2025-04-28 21:21:13,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.38
[2025-04-28 21:21:13,124 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.41 given in one single declaration
[2025-04-28 21:21:13,124 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.41
[2025-04-28 21:21:13,124 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.41
[2025-04-28 21:21:13,125 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.46 given in one single declaration
[2025-04-28 21:21:13,125 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.46
[2025-04-28 21:21:13,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.46
[2025-04-28 21:21:13,125 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.49 given in one single declaration
[2025-04-28 21:21:13,125 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.49
[2025-04-28 21:21:13,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.49
[2025-04-28 21:21:13,125 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.52 given in one single declaration
[2025-04-28 21:21:13,125 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.52
[2025-04-28 21:21:13,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.52
[2025-04-28 21:21:13,126 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:13,126 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:13,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:13,221 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:13,225 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:13,526 INFO  L?                        ?]: Removed 4 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:13,526 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:13,552 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:13,552 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:13,553 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:13 BoogieIcfgContainer
[2025-04-28 21:21:13,553 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:13,556 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:13,557 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:13,562 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:13,562 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:12" (1/3) ...
[2025-04-28 21:21:13,563 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605b8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:13, skipping insertion in model container
[2025-04-28 21:21:13,563 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:12" (2/3) ...
[2025-04-28 21:21:13,563 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605b8c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:13, skipping insertion in model container
[2025-04-28 21:21:13,563 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:13" (3/3) ...
[2025-04-28 21:21:13,565 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:13,591 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:13,594 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 17 procedures, 81 locations, 136 edges, 17 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:13,657 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:13,676 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d996a00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:13,679 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:13,688 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 81 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 48 states have internal predecessors, (49), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 29 states have call successors, (29)
[2025-04-28 21:21:13,710 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:13,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:13,711 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:13,711 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:13,720 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:13,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -1744554755, now seen corresponding path program 1 times
[2025-04-28 21:21:13,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:13,733 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860900445]
[2025-04-28 21:21:13,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:13,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:13,783 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:13,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:13,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:13,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:15,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:15,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:15,675 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860900445]
[2025-04-28 21:21:15,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860900445] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:15,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:15,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2025-04-28 21:21:15,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767481949]
[2025-04-28 21:21:15,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:15,687 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:15,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:15,717 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:15,717 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:15,720 INFO  L87              Difference]: Start difference. First operand  has 81 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 48 states have internal predecessors, (49), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 29 states have call successors, (29) Second operand  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:16,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:16,989 INFO  L93              Difference]: Finished difference Result 127 states and 164 transitions.
[2025-04-28 21:21:16,991 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-04-28 21:21:16,992 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65
[2025-04-28 21:21:16,993 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:17,002 INFO  L225             Difference]: With dead ends: 127
[2025-04-28 21:21:17,002 INFO  L226             Difference]: Without dead ends: 113
[2025-04-28 21:21:17,008 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:17,013 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 12 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:17,014 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1742 Invalid, 691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-04-28 21:21:17,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-04-28 21:21:17,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97.
[2025-04-28 21:21:17,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 56 states have internal predecessors, (56), 29 states have call successors, (29), 16 states have call predecessors, (29), 25 states have return successors, (46), 24 states have call predecessors, (46), 29 states have call successors, (46)
[2025-04-28 21:21:17,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions.
[2025-04-28 21:21:17,093 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 65
[2025-04-28 21:21:17,094 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:17,094 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 131 transitions.
[2025-04-28 21:21:17,094 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:17,094 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions.
[2025-04-28 21:21:17,101 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:17,101 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:17,101 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:17,102 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:17,102 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:17,103 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:17,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -938171686, now seen corresponding path program 1 times
[2025-04-28 21:21:17,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:17,103 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179588660]
[2025-04-28 21:21:17,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:17,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:17,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:17,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:17,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:17,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:18,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,101 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179588660]
[2025-04-28 21:21:18,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179588660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:18,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:18,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:18,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475347511]
[2025-04-28 21:21:18,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,104 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:18,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:18,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:18,106 INFO  L87              Difference]: Start difference. First operand 97 states and 131 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:19,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:19,021 INFO  L93              Difference]: Finished difference Result 129 states and 168 transitions.
[2025-04-28 21:21:19,022 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:19,022 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:19,023 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:19,024 INFO  L225             Difference]: With dead ends: 129
[2025-04-28 21:21:19,024 INFO  L226             Difference]: Without dead ends: 111
[2025-04-28 21:21:19,025 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:19,026 INFO  L437           NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:19,026 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2119 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:19,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2025-04-28 21:21:19,040 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101.
[2025-04-28 21:21:19,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 58 states have internal predecessors, (58), 29 states have call successors, (29), 16 states have call predecessors, (29), 27 states have return successors, (49), 26 states have call predecessors, (49), 29 states have call successors, (49)
[2025-04-28 21:21:19,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions.
[2025-04-28 21:21:19,042 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 65
[2025-04-28 21:21:19,043 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:19,043 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 136 transitions.
[2025-04-28 21:21:19,043 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:19,043 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions.
[2025-04-28 21:21:19,045 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:19,045 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:19,045 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:19,045 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:19,046 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:19,047 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:19,048 INFO  L85        PathProgramCache]: Analyzing trace with hash 1281206804, now seen corresponding path program 1 times
[2025-04-28 21:21:19,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:19,048 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442478137]
[2025-04-28 21:21:19,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:19,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:19,093 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:19,108 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:19,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:19,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:19,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:19,857 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442478137]
[2025-04-28 21:21:19,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442478137] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:19,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:19,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:19,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536418191]
[2025-04-28 21:21:19,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:19,858 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:19,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:19,859 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:19,859 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:19,859 INFO  L87              Difference]: Start difference. First operand 101 states and 136 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:20,664 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:20,664 INFO  L93              Difference]: Finished difference Result 139 states and 182 transitions.
[2025-04-28 21:21:20,665 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:20,665 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:20,666 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:20,667 INFO  L225             Difference]: With dead ends: 139
[2025-04-28 21:21:20,668 INFO  L226             Difference]: Without dead ends: 121
[2025-04-28 21:21:20,668 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:20,669 INFO  L437           NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:20,670 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1959 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:20,671 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-04-28 21:21:20,683 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105.
[2025-04-28 21:21:20,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 16 states have call predecessors, (29), 29 states have return successors, (53), 28 states have call predecessors, (53), 29 states have call successors, (53)
[2025-04-28 21:21:20,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions.
[2025-04-28 21:21:20,685 INFO  L79                 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 65
[2025-04-28 21:21:20,685 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:20,685 INFO  L485      AbstractCegarLoop]: Abstraction has 105 states and 142 transitions.
[2025-04-28 21:21:20,686 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:20,686 INFO  L278                IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions.
[2025-04-28 21:21:20,688 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:20,688 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:20,688 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:20,688 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:20,688 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:20,689 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:20,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -970214950, now seen corresponding path program 1 times
[2025-04-28 21:21:20,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:20,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250573046]
[2025-04-28 21:21:20,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:20,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:20,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:20,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:20,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:20,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:21,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:21,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:21,437 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250573046]
[2025-04-28 21:21:21,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250573046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:21,437 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:21,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:21,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495161213]
[2025-04-28 21:21:21,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,438 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:21,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,439 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:21,439 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:21,440 INFO  L87              Difference]: Start difference. First operand 105 states and 142 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:22,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:22,235 INFO  L93              Difference]: Finished difference Result 135 states and 176 transitions.
[2025-04-28 21:21:22,235 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2025-04-28 21:21:22,235 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:22,236 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:22,239 INFO  L225             Difference]: With dead ends: 135
[2025-04-28 21:21:22,242 INFO  L226             Difference]: Without dead ends: 127
[2025-04-28 21:21:22,243 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:22,244 INFO  L437           NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:22,245 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2117 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:22,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-04-28 21:21:22,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117.
[2025-04-28 21:21:22,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 66 states have internal predecessors, (66), 29 states have call successors, (29), 16 states have call predecessors, (29), 35 states have return successors, (62), 34 states have call predecessors, (62), 29 states have call successors, (62)
[2025-04-28 21:21:22,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions.
[2025-04-28 21:21:22,282 INFO  L79                 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 65
[2025-04-28 21:21:22,282 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:22,282 INFO  L485      AbstractCegarLoop]: Abstraction has 117 states and 157 transitions.
[2025-04-28 21:21:22,282 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:22,287 INFO  L278                IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions.
[2025-04-28 21:21:22,289 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:22,289 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:22,289 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:22,290 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:22,290 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,291 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -726647148, now seen corresponding path program 1 times
[2025-04-28 21:21:22,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,295 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929214908]
[2025-04-28 21:21:22,295 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:22,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:22,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:22,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,892 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929214908]
[2025-04-28 21:21:22,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929214908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:22,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:22,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:22,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406844798]
[2025-04-28 21:21:22,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,893 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:22,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:22,895 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:22,895 INFO  L87              Difference]: Start difference. First operand 117 states and 157 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:23,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,505 INFO  L93              Difference]: Finished difference Result 137 states and 180 transitions.
[2025-04-28 21:21:23,506 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:23,506 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:23,506 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,508 INFO  L225             Difference]: With dead ends: 137
[2025-04-28 21:21:23,508 INFO  L226             Difference]: Without dead ends: 135
[2025-04-28 21:21:23,508 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:23,509 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,509 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1742 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:23,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2025-04-28 21:21:23,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125.
[2025-04-28 21:21:23,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 56 states have (on average 1.25) internal successors, (70), 70 states have internal predecessors, (70), 29 states have call successors, (29), 16 states have call predecessors, (29), 39 states have return successors, (69), 38 states have call predecessors, (69), 29 states have call successors, (69)
[2025-04-28 21:21:23,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions.
[2025-04-28 21:21:23,524 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 65
[2025-04-28 21:21:23,524 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,524 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 168 transitions.
[2025-04-28 21:21:23,525 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:23,525 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions.
[2025-04-28 21:21:23,526 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:23,526 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,526 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,527 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:23,527 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,527 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -694603884, now seen corresponding path program 1 times
[2025-04-28 21:21:23,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,528 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46440450]
[2025-04-28 21:21:23,528 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,543 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:23,556 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:23,556 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,556 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:24,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:24,139 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46440450]
[2025-04-28 21:21:24,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46440450] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:24,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:24,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:24,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438175066]
[2025-04-28 21:21:24,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:24,140 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:24,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:24,143 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:24,144 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:24,144 INFO  L87              Difference]: Start difference. First operand 125 states and 168 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:24,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:24,872 INFO  L93              Difference]: Finished difference Result 151 states and 199 transitions.
[2025-04-28 21:21:24,873 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-04-28 21:21:24,873 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:24,874 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:24,875 INFO  L225             Difference]: With dead ends: 151
[2025-04-28 21:21:24,877 INFO  L226             Difference]: Without dead ends: 149
[2025-04-28 21:21:24,878 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:24,879 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:24,879 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1866 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:24,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-04-28 21:21:24,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133.
[2025-04-28 21:21:24,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 74 states have internal predecessors, (74), 29 states have call successors, (29), 16 states have call predecessors, (29), 43 states have return successors, (76), 42 states have call predecessors, (76), 29 states have call successors, (76)
[2025-04-28 21:21:24,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 179 transitions.
[2025-04-28 21:21:24,914 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 179 transitions. Word has length 65
[2025-04-28 21:21:24,915 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:24,915 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 179 transitions.
[2025-04-28 21:21:24,915 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:24,915 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 179 transitions.
[2025-04-28 21:21:24,916 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:24,916 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,917 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:24,917 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:24,917 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,917 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -646278182, now seen corresponding path program 1 times
[2025-04-28 21:21:24,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,917 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055509643]
[2025-04-28 21:21:24,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:24,940 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:24,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:25,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,513 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055509643]
[2025-04-28 21:21:25,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055509643] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:25,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:25,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130612443]
[2025-04-28 21:21:25,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,515 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:25,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:25,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:25,516 INFO  L87              Difference]: Start difference. First operand 133 states and 179 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:26,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:26,177 INFO  L93              Difference]: Finished difference Result 163 states and 212 transitions.
[2025-04-28 21:21:26,177 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-04-28 21:21:26,178 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:26,178 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:26,180 INFO  L225             Difference]: With dead ends: 163
[2025-04-28 21:21:26,180 INFO  L226             Difference]: Without dead ends: 143
[2025-04-28 21:21:26,180 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:26,181 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:26,181 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1698 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:26,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2025-04-28 21:21:26,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133.
[2025-04-28 21:21:26,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 74 states have internal predecessors, (74), 29 states have call successors, (29), 16 states have call predecessors, (29), 43 states have return successors, (75), 42 states have call predecessors, (75), 29 states have call successors, (75)
[2025-04-28 21:21:26,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions.
[2025-04-28 21:21:26,196 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 65
[2025-04-28 21:21:26,197 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:26,197 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 178 transitions.
[2025-04-28 21:21:26,197 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:26,197 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions.
[2025-04-28 21:21:26,199 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:26,199 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,199 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:26,199 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:26,199 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,200 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -402710380, now seen corresponding path program 1 times
[2025-04-28 21:21:26,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,200 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797959802]
[2025-04-28 21:21:26,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:26,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:26,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:26,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797959802]
[2025-04-28 21:21:26,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797959802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,772 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-04-28 21:21:26,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456877504]
[2025-04-28 21:21:26,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,773 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-04-28 21:21:26,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-04-28 21:21:26,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:26,774 INFO  L87              Difference]: Start difference. First operand 133 states and 178 transitions. Second operand  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:27,402 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,402 INFO  L93              Difference]: Finished difference Result 161 states and 211 transitions.
[2025-04-28 21:21:27,403 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-04-28 21:21:27,403 INFO  L79                 Accepts]: Start accepts. Automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 65
[2025-04-28 21:21:27,403 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,405 INFO  L225             Difference]: With dead ends: 161
[2025-04-28 21:21:27,405 INFO  L226             Difference]: Without dead ends: 159
[2025-04-28 21:21:27,405 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650
[2025-04-28 21:21:27,406 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,406 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1782 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:27,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 159 states.
[2025-04-28 21:21:27,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133.
[2025-04-28 21:21:27,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 74 states have internal predecessors, (74), 29 states have call successors, (29), 16 states have call predecessors, (29), 43 states have return successors, (75), 42 states have call predecessors, (75), 29 states have call successors, (75)
[2025-04-28 21:21:27,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions.
[2025-04-28 21:21:27,430 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 65
[2025-04-28 21:21:27,435 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,435 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 178 transitions.
[2025-04-28 21:21:27,435 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 16 states have (on average 2.0625) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:27,435 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions.
[2025-04-28 21:21:27,436 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:27,436 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,436 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,437 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:27,437 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,437 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,437 INFO  L85        PathProgramCache]: Analyzing trace with hash -748692937, now seen corresponding path program 1 times
[2025-04-28 21:21:27,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,437 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135324538]
[2025-04-28 21:21:27,437 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,452 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:27,463 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:27,463 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,463 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:28,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,091 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135324538]
[2025-04-28 21:21:28,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135324538] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2025-04-28 21:21:28,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374737432]
[2025-04-28 21:21:28,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,092 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:28,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,092 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:28,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:28,093 INFO  L87              Difference]: Start difference. First operand 133 states and 178 transitions. Second operand  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:28,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,852 INFO  L93              Difference]: Finished difference Result 161 states and 209 transitions.
[2025-04-28 21:21:28,853 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-04-28 21:21:28,854 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65
[2025-04-28 21:21:28,854 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,855 INFO  L225             Difference]: With dead ends: 161
[2025-04-28 21:21:28,855 INFO  L226             Difference]: Without dead ends: 145
[2025-04-28 21:21:28,856 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:28,856 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,857 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2048 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:28,858 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-04-28 21:21:28,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133.
[2025-04-28 21:21:28,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 74 states have internal predecessors, (74), 29 states have call successors, (29), 16 states have call predecessors, (29), 43 states have return successors, (74), 42 states have call predecessors, (74), 29 states have call successors, (74)
[2025-04-28 21:21:28,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions.
[2025-04-28 21:21:28,870 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 65
[2025-04-28 21:21:28,870 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,871 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 177 transitions.
[2025-04-28 21:21:28,871 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:28,871 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions.
[2025-04-28 21:21:28,872 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:28,872 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,873 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,873 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:28,873 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,873 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862357175, now seen corresponding path program 1 times
[2025-04-28 21:21:28,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,874 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398583273]
[2025-04-28 21:21:28,874 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,886 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:28,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:28,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,901 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:29,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,520 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398583273]
[2025-04-28 21:21:29,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398583273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:29,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:29,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2025-04-28 21:21:29,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837090730]
[2025-04-28 21:21:29,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,520 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:29,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:29,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:29,522 INFO  L87              Difference]: Start difference. First operand 133 states and 177 transitions. Second operand  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:30,173 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,173 INFO  L93              Difference]: Finished difference Result 151 states and 196 transitions.
[2025-04-28 21:21:30,173 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-04-28 21:21:30,173 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65
[2025-04-28 21:21:30,174 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,175 INFO  L225             Difference]: With dead ends: 151
[2025-04-28 21:21:30,175 INFO  L226             Difference]: Without dead ends: 149
[2025-04-28 21:21:30,175 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:30,176 INFO  L437           NwaCegarLoop]: 86 mSDtfsCounter, 12 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,176 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1846 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:30,177 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-04-28 21:21:30,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121.
[2025-04-28 21:21:30,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 68 states have internal predecessors, (68), 29 states have call successors, (29), 16 states have call predecessors, (29), 37 states have return successors, (64), 36 states have call predecessors, (64), 29 states have call successors, (64)
[2025-04-28 21:21:30,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions.
[2025-04-28 21:21:30,187 INFO  L79                 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 65
[2025-04-28 21:21:30,187 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,187 INFO  L485      AbstractCegarLoop]: Abstraction has 121 states and 161 transitions.
[2025-04-28 21:21:30,188 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:30,188 INFO  L278                IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions.
[2025-04-28 21:21:30,197 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:30,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,197 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,197 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:30,197 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,198 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,198 INFO  L85        PathProgramCache]: Analyzing trace with hash -456799433, now seen corresponding path program 1 times
[2025-04-28 21:21:30,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,198 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130410697]
[2025-04-28 21:21:30,198 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:30,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:30,219 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:30,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,785 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130410697]
[2025-04-28 21:21:30,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130410697] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2025-04-28 21:21:30,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858452426]
[2025-04-28 21:21:30,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,786 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:30,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,787 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:30,787 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:30,788 INFO  L87              Difference]: Start difference. First operand 121 states and 161 transitions. Second operand  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:31,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,322 INFO  L93              Difference]: Finished difference Result 153 states and 197 transitions.
[2025-04-28 21:21:31,323 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2025-04-28 21:21:31,323 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65
[2025-04-28 21:21:31,324 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,325 INFO  L225             Difference]: With dead ends: 153
[2025-04-28 21:21:31,325 INFO  L226             Difference]: Without dead ends: 129
[2025-04-28 21:21:31,325 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:31,326 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,326 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1866 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:31,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-04-28 21:21:31,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117.
[2025-04-28 21:21:31,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 66 states have internal predecessors, (66), 29 states have call successors, (29), 16 states have call predecessors, (29), 35 states have return successors, (60), 34 states have call predecessors, (60), 29 states have call successors, (60)
[2025-04-28 21:21:31,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions.
[2025-04-28 21:21:31,335 INFO  L79                 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 65
[2025-04-28 21:21:31,335 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,335 INFO  L485      AbstractCegarLoop]: Abstraction has 117 states and 155 transitions.
[2025-04-28 21:21:31,335 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 16 states have (on average 2.0625) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:31,335 INFO  L278                IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions.
[2025-04-28 21:21:31,336 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:31,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,336 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,337 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:21:31,337 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,337 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 1808268122, now seen corresponding path program 1 times
[2025-04-28 21:21:31,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,337 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890548558]
[2025-04-28 21:21:31,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,347 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:31,355 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:31,355 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,356 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:31,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,942 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890548558]
[2025-04-28 21:21:31,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890548558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2025-04-28 21:21:31,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091630887]
[2025-04-28 21:21:31,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,943 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:21:31,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:21:31,943 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:31,944 INFO  L87              Difference]: Start difference. First operand 117 states and 155 transitions. Second operand  has 24 states, 16 states have (on average 2.0625) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 9 states have call successors, (16)
[2025-04-28 21:21:32,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,540 INFO  L93              Difference]: Finished difference Result 133 states and 170 transitions.
[2025-04-28 21:21:32,540 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-04-28 21:21:32,541 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 16 states have (on average 2.0625) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 9 states have call successors, (16) Word has length 65
[2025-04-28 21:21:32,541 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,542 INFO  L225             Difference]: With dead ends: 133
[2025-04-28 21:21:32,542 INFO  L226             Difference]: Without dead ends: 91
[2025-04-28 21:21:32,543 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:32,543 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 14 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,544 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1891 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:32,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-04-28 21:21:32,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79.
[2025-04-28 21:21:32,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.393939393939394) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (29), 16 states have call predecessors, (29), 29 states have call successors, (29)
[2025-04-28 21:21:32,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions.
[2025-04-28 21:21:32,549 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 65
[2025-04-28 21:21:32,549 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,549 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 104 transitions.
[2025-04-28 21:21:32,550 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 16 states have (on average 2.0625) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (16), 14 states have call predecessors, (16), 9 states have call successors, (16)
[2025-04-28 21:21:32,550 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions.
[2025-04-28 21:21:32,550 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:32,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,551 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,551 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-04-28 21:21:32,551 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,552 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1112812312, now seen corresponding path program 1 times
[2025-04-28 21:21:32,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,552 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812737886]
[2025-04-28 21:21:32,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,560 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:32,563 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:32,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,564 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:32,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,867 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812737886]
[2025-04-28 21:21:32,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812737886] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2025-04-28 21:21:32,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671219135]
[2025-04-28 21:21:32,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,868 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:32,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,868 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:32,868 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:32,869 INFO  L87              Difference]: Start difference. First operand 79 states and 104 transitions. Second operand  has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16)
[2025-04-28 21:21:33,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,184 INFO  L93              Difference]: Finished difference Result 75 states and 100 transitions.
[2025-04-28 21:21:33,184 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-28 21:21:33,185 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) Word has length 65
[2025-04-28 21:21:33,185 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,185 INFO  L225             Difference]: With dead ends: 75
[2025-04-28 21:21:33,185 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:21:33,185 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:33,186 INFO  L437           NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,186 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1196 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:33,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:21:33,187 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:21:33,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-28 21:21:33,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:21:33,187 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65
[2025-04-28 21:21:33,187 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,187 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:21:33,187 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (16), 1 states have call predecessors, (16), 16 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16)
[2025-04-28 21:21:33,188 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:21:33,189 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:21:33,191 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:33,191 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-04-28 21:21:33,195 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,200 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:33,204 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,204 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:33,205 INFO  L158              Benchmark]: Toolchain (without parser) took 20318.54ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 160.8MB in the beginning and 104.0MB in the end (delta: 56.8MB). Peak memory consumption was 27.3MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,205 INFO  L158              Benchmark]: SmtParser took 0.49ms. Allocated memory is still 234.9MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,205 INFO  L158              Benchmark]: ChcToBoogie took 51.35ms. Allocated memory is still 234.9MB. Free memory was 160.8MB in the beginning and 159.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,206 INFO  L158              Benchmark]: Boogie Preprocessor took 107.96ms. Allocated memory is still 234.9MB. Free memory was 159.2MB in the beginning and 156.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:33,206 INFO  L158              Benchmark]: RCFGBuilder took 504.91ms. Allocated memory is still 234.9MB. Free memory was 156.9MB in the beginning and 140.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,206 INFO  L158              Benchmark]: TraceAbstraction took 19647.83ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 140.1MB in the beginning and 104.0MB in the end (delta: 36.1MB). Peak memory consumption was 10.5MB. Max. memory is 33.6GB.
[2025-04-28 21:21:33,207 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.49ms. Allocated memory is still 234.9MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 51.35ms. Allocated memory is still 234.9MB. Free memory was 160.8MB in the beginning and 159.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 107.96ms. Allocated memory is still 234.9MB. Free memory was 159.2MB in the beginning and 156.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 504.91ms. Allocated memory is still 234.9MB. Free memory was 156.9MB in the beginning and 140.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 19647.83ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 140.1MB in the beginning and 104.0MB in the end (delta: 36.1MB). Peak memory consumption was 10.5MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 17 procedures, 81 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 23872 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22697 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7450 IncrementalHoareTripleChecker+Invalid, 7589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1175 mSDtfsCounter, 7450 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=6, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 178 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 832 ConstructedInterpolants, 0 QuantifiedInterpolants, 2518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-04-28 21:21:33,222 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
