./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:48:25,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:48:25,854 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 12:48:25,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:48:25,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:48:25,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:48:25,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:48:25,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:48:25,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:48:25,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:48:25,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:48:25,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:48:25,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:48:25,906 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 12:48:25,906 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 12:48:25,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:48:25,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:48:25,908 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 12:48:25,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:48:25,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:48:25,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:48:25,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:48:25,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:48:25,911 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 12:48:25,911 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-11-13 12:48:26,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:48:26,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:48:26,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:48:26,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:48:26,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:48:26,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_12.c Unable to find full path for "g++" [2024-11-13 12:48:28,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:48:28,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:48:28,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/sv-benchmarks/c/locks/test_locks_12.c [2024-11-13 12:48:28,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/data/f37b238d6/f17934878af941899c5726f658c66ebe/FLAGac10e7dc5 [2024-11-13 12:48:28,445 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/data/f37b238d6/f17934878af941899c5726f658c66ebe [2024-11-13 12:48:28,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:48:28,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:48:28,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:28,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:48:28,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:48:28,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb2a64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28, skipping insertion in model container [2024-11-13 12:48:28,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:48:28,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:28,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:48:28,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:28,729 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:48:28,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28 WrapperNode [2024-11-13 12:48:28,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:28,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:28,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:48:28,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:48:28,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,771 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 159 [2024-11-13 12:48:28,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:28,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:48:28,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:48:28,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:48:28,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:48:28,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:48:28,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:48:28,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:48:28,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:48:28,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (1/1) ... [2024-11-13 12:48:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:48:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:28,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:48:28,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 12:48:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:48:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:48:28,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:48:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:48:28,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:48:28,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:48:29,199 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-13 12:48:29,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:48:29,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:48:29,209 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:48:29,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:29 BoogieIcfgContainer [2024-11-13 12:48:29,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:48:29,210 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 12:48:29,210 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 12:48:29,215 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 12:48:29,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:48:29,216 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 12:48:28" (1/3) ... [2024-11-13 12:48:29,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51e76f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:48:29, skipping insertion in model container [2024-11-13 12:48:29,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:48:29,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:28" (2/3) ... [2024-11-13 12:48:29,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51e76f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:48:29, skipping insertion in model container [2024-11-13 12:48:29,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:48:29,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:29" (3/3) ... [2024-11-13 12:48:29,219 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2024-11-13 12:48:29,277 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 12:48:29,277 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 12:48:29,278 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 12:48:29,278 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 12:48:29,278 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 12:48:29,278 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 12:48:29,278 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 12:48:29,278 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 12:48:29,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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) [2024-11-13 12:48:29,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2024-11-13 12:48:29,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:29,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:29,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:29,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:29,302 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 12:48:29,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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) [2024-11-13 12:48:29,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2024-11-13 12:48:29,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:29,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:29,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:29,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:29,319 INFO L745 eck$LassoCheckResult]: Stem: 46#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 32#L183-1true [2024-11-13 12:48:29,322 INFO L747 eck$LassoCheckResult]: Loop: 32#L183-1true assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 17#L49true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 33#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L82-1true assume !(0 != main_~p3~0#1); 8#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 34#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 11#L94-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 31#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 25#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 41#L114-1true assume !(0 != main_~p11~0#1); 30#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13#L122-1true assume !(0 != main_~p1~0#1); 27#L128-1true assume !(0 != main_~p2~0#1); 4#L133-1true assume !(0 != main_~p3~0#1); 3#L138-1true assume !(0 != main_~p4~0#1); 26#L143-1true assume !(0 != main_~p5~0#1); 5#L148-1true assume !(0 != main_~p6~0#1); 22#L153-1true assume !(0 != main_~p7~0#1); 38#L158-1true assume !(0 != main_~p8~0#1); 24#L163-1true assume !(0 != main_~p9~0#1); 40#L168-1true assume !(0 != main_~p10~0#1); 18#L173-1true assume !(0 != main_~p11~0#1); 7#L178-1true assume !(0 != main_~p12~0#1); 32#L183-1true [2024-11-13 12:48:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 12:48:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957633535] [2024-11-13 12:48:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:29,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash -708087768, now seen corresponding path program 1 times [2024-11-13 12:48:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352926397] [2024-11-13 12:48:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:29,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352926397] [2024-11-13 12:48:29,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352926397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:29,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:29,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866532085] [2024-11-13 12:48:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:29,657 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:29,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:29,695 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:29,741 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2024-11-13 12:48:29,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 153 transitions. [2024-11-13 12:48:29,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2024-11-13 12:48:29,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 77 states and 123 transitions. [2024-11-13 12:48:29,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-11-13 12:48:29,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-11-13 12:48:29,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2024-11-13 12:48:29,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:29,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-11-13 12:48:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2024-11-13 12:48:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-13 12:48:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 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) [2024-11-13 12:48:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-11-13 12:48:29,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-11-13 12:48:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:29,792 INFO L424 stractBuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-11-13 12:48:29,792 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 12:48:29,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2024-11-13 12:48:29,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2024-11-13 12:48:29,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:29,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:29,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:29,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:29,795 INFO L745 eck$LassoCheckResult]: Stem: 185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 152#L183-1 [2024-11-13 12:48:29,795 INFO L747 eck$LassoCheckResult]: Loop: 152#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 166#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 167#L78 assume !(0 != main_~p1~0#1); 195#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 194#L82-1 assume !(0 != main_~p3~0#1); 193#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 183#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 157#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 158#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 170#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 190#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 189#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 188#L114-1 assume !(0 != main_~p11~0#1); 187#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 186#L122-1 assume !(0 != main_~p1~0#1); 178#L128-1 assume !(0 != main_~p2~0#1); 143#L133-1 assume !(0 != main_~p3~0#1); 140#L138-1 assume !(0 != main_~p4~0#1); 141#L143-1 assume !(0 != main_~p5~0#1); 145#L148-1 assume !(0 != main_~p6~0#1); 147#L153-1 assume !(0 != main_~p7~0#1); 206#L158-1 assume !(0 != main_~p8~0#1); 204#L163-1 assume !(0 != main_~p9~0#1); 202#L168-1 assume !(0 != main_~p10~0#1); 200#L173-1 assume !(0 != main_~p11~0#1); 198#L178-1 assume !(0 != main_~p12~0#1); 152#L183-1 [2024-11-13 12:48:29,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 12:48:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447786172] [2024-11-13 12:48:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -842101274, now seen corresponding path program 1 times [2024-11-13 12:48:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946557429] [2024-11-13 12:48:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946557429] [2024-11-13 12:48:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946557429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:29,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:29,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308873790] [2024-11-13 12:48:29,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:29,899 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:29,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:29,900 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:29,935 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2024-11-13 12:48:29,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2024-11-13 12:48:29,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2024-11-13 12:48:29,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2024-11-13 12:48:29,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2024-11-13 12:48:29,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2024-11-13 12:48:29,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2024-11-13 12:48:29,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:29,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-11-13 12:48:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2024-11-13 12:48:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-13 12:48:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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) [2024-11-13 12:48:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2024-11-13 12:48:29,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-11-13 12:48:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:29,953 INFO L424 stractBuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-11-13 12:48:29,953 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 12:48:29,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2024-11-13 12:48:29,955 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2024-11-13 12:48:29,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:29,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:29,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:29,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:29,956 INFO L745 eck$LassoCheckResult]: Stem: 427#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 385#L183-1 [2024-11-13 12:48:29,957 INFO L747 eck$LassoCheckResult]: Loop: 385#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 447#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 445#L78 assume !(0 != main_~p1~0#1); 444#L78-2 assume !(0 != main_~p2~0#1); 394#L82-1 assume !(0 != main_~p3~0#1); 388#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 389#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 437#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 438#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 417#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 418#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 431#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 432#L114-1 assume !(0 != main_~p11~0#1); 429#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 430#L122-1 assume !(0 != main_~p1~0#1); 488#L128-1 assume !(0 != main_~p2~0#1); 485#L133-1 assume !(0 != main_~p3~0#1); 481#L138-1 assume !(0 != main_~p4~0#1); 477#L143-1 assume !(0 != main_~p5~0#1); 473#L148-1 assume !(0 != main_~p6~0#1); 469#L153-1 assume !(0 != main_~p7~0#1); 467#L158-1 assume !(0 != main_~p8~0#1); 463#L163-1 assume !(0 != main_~p9~0#1); 459#L168-1 assume !(0 != main_~p10~0#1); 455#L173-1 assume !(0 != main_~p11~0#1); 451#L178-1 assume !(0 != main_~p12~0#1); 385#L183-1 [2024-11-13 12:48:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 12:48:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719299804] [2024-11-13 12:48:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:29,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1647427688, now seen corresponding path program 1 times [2024-11-13 12:48:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88599785] [2024-11-13 12:48:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88599785] [2024-11-13 12:48:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88599785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668000898] [2024-11-13 12:48:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,036 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,036 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,067 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2024-11-13 12:48:30,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2024-11-13 12:48:30,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2024-11-13 12:48:30,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2024-11-13 12:48:30,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-11-13 12:48:30,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-11-13 12:48:30,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2024-11-13 12:48:30,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:30,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-11-13 12:48:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2024-11-13 12:48:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-13 12:48:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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) [2024-11-13 12:48:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2024-11-13 12:48:30,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-11-13 12:48:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,112 INFO L424 stractBuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-11-13 12:48:30,112 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 12:48:30,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2024-11-13 12:48:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2024-11-13 12:48:30,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:30,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:30,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:30,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:30,116 INFO L745 eck$LassoCheckResult]: Stem: 871#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 830#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 831#L183-1 [2024-11-13 12:48:30,116 INFO L747 eck$LassoCheckResult]: Loop: 831#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 887#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 884#L78 assume !(0 != main_~p1~0#1); 885#L78-2 assume !(0 != main_~p2~0#1); 962#L82-1 assume !(0 != main_~p3~0#1); 958#L86-1 assume !(0 != main_~p4~0#1); 955#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 952#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 949#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 946#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 943#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 940#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 937#L114-1 assume !(0 != main_~p11~0#1); 935#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 932#L122-1 assume !(0 != main_~p1~0#1); 929#L128-1 assume !(0 != main_~p2~0#1); 927#L133-1 assume !(0 != main_~p3~0#1); 922#L138-1 assume !(0 != main_~p4~0#1); 920#L143-1 assume !(0 != main_~p5~0#1); 916#L148-1 assume !(0 != main_~p6~0#1); 912#L153-1 assume !(0 != main_~p7~0#1); 908#L158-1 assume !(0 != main_~p8~0#1); 904#L163-1 assume !(0 != main_~p9~0#1); 900#L168-1 assume !(0 != main_~p10~0#1); 896#L173-1 assume !(0 != main_~p11~0#1); 892#L178-1 assume !(0 != main_~p12~0#1); 831#L183-1 [2024-11-13 12:48:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 12:48:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070048623] [2024-11-13 12:48:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2070129514, now seen corresponding path program 1 times [2024-11-13 12:48:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370928724] [2024-11-13 12:48:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370928724] [2024-11-13 12:48:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370928724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742679093] [2024-11-13 12:48:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,207 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,208 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,238 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2024-11-13 12:48:30,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2024-11-13 12:48:30,245 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2024-11-13 12:48:30,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2024-11-13 12:48:30,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2024-11-13 12:48:30,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2024-11-13 12:48:30,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2024-11-13 12:48:30,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:30,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-11-13 12:48:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2024-11-13 12:48:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2024-11-13 12:48:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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) [2024-11-13 12:48:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2024-11-13 12:48:30,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-11-13 12:48:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,278 INFO L424 stractBuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-11-13 12:48:30,278 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 12:48:30,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2024-11-13 12:48:30,282 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2024-11-13 12:48:30,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:30,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:30,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:30,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:30,283 INFO L745 eck$LassoCheckResult]: Stem: 1752#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 1710#L183-1 [2024-11-13 12:48:30,283 INFO L747 eck$LassoCheckResult]: Loop: 1710#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1770#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 1771#L78 assume !(0 != main_~p1~0#1); 1870#L78-2 assume !(0 != main_~p2~0#1); 1868#L82-1 assume !(0 != main_~p3~0#1); 1864#L86-1 assume !(0 != main_~p4~0#1); 1862#L90-1 assume !(0 != main_~p5~0#1); 1860#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1858#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1856#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1854#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1852#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1850#L114-1 assume !(0 != main_~p11~0#1); 1848#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1844#L122-1 assume !(0 != main_~p1~0#1); 1840#L128-1 assume !(0 != main_~p2~0#1); 1837#L133-1 assume !(0 != main_~p3~0#1); 1832#L138-1 assume !(0 != main_~p4~0#1); 1830#L143-1 assume !(0 != main_~p5~0#1); 1812#L148-1 assume !(0 != main_~p6~0#1); 1811#L153-1 assume !(0 != main_~p7~0#1); 1800#L158-1 assume !(0 != main_~p8~0#1); 1799#L163-1 assume !(0 != main_~p9~0#1); 1788#L168-1 assume !(0 != main_~p10~0#1); 1787#L173-1 assume !(0 != main_~p11~0#1); 1778#L178-1 assume !(0 != main_~p12~0#1); 1710#L183-1 [2024-11-13 12:48:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 12:48:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133122195] [2024-11-13 12:48:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1252481064, now seen corresponding path program 1 times [2024-11-13 12:48:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667431910] [2024-11-13 12:48:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667431910] [2024-11-13 12:48:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667431910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750460097] [2024-11-13 12:48:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,353 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,354 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,375 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2024-11-13 12:48:30,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2024-11-13 12:48:30,385 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2024-11-13 12:48:30,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2024-11-13 12:48:30,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2024-11-13 12:48:30,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2024-11-13 12:48:30,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2024-11-13 12:48:30,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:30,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-11-13 12:48:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2024-11-13 12:48:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-13 12:48:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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) [2024-11-13 12:48:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2024-11-13 12:48:30,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-11-13 12:48:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,431 INFO L424 stractBuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-11-13 12:48:30,431 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 12:48:30,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2024-11-13 12:48:30,438 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2024-11-13 12:48:30,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:30,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:30,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:30,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:30,443 INFO L745 eck$LassoCheckResult]: Stem: 3470#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 3430#L183-1 [2024-11-13 12:48:30,443 INFO L747 eck$LassoCheckResult]: Loop: 3430#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3779#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 3780#L78 assume !(0 != main_~p1~0#1); 3500#L78-2 assume !(0 != main_~p2~0#1); 3502#L82-1 assume !(0 != main_~p3~0#1); 3978#L86-1 assume !(0 != main_~p4~0#1); 3754#L90-1 assume !(0 != main_~p5~0#1); 3728#L94-1 assume !(0 != main_~p6~0#1); 3730#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3720#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3721#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3712#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3713#L114-1 assume !(0 != main_~p11~0#1); 3704#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3705#L122-1 assume !(0 != main_~p1~0#1); 3695#L128-1 assume !(0 != main_~p2~0#1); 3692#L133-1 assume !(0 != main_~p3~0#1); 3691#L138-1 assume !(0 != main_~p4~0#1); 3850#L143-1 assume !(0 != main_~p5~0#1); 3844#L148-1 assume !(0 != main_~p6~0#1); 3838#L153-1 assume !(0 != main_~p7~0#1); 3831#L158-1 assume !(0 != main_~p8~0#1); 3830#L163-1 assume !(0 != main_~p9~0#1); 3815#L168-1 assume !(0 != main_~p10~0#1); 3808#L173-1 assume !(0 != main_~p11~0#1); 3792#L178-1 assume !(0 != main_~p12~0#1); 3430#L183-1 [2024-11-13 12:48:30,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 12:48:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707544706] [2024-11-13 12:48:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash -436462678, now seen corresponding path program 1 times [2024-11-13 12:48:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181055425] [2024-11-13 12:48:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181055425] [2024-11-13 12:48:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181055425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601854364] [2024-11-13 12:48:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,497 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,497 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,529 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2024-11-13 12:48:30,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2024-11-13 12:48:30,555 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2024-11-13 12:48:30,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2024-11-13 12:48:30,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2024-11-13 12:48:30,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2024-11-13 12:48:30,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2024-11-13 12:48:30,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:30,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-11-13 12:48:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2024-11-13 12:48:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2024-11-13 12:48:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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) [2024-11-13 12:48:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2024-11-13 12:48:30,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-11-13 12:48:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,690 INFO L424 stractBuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-11-13 12:48:30,690 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 12:48:30,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2024-11-13 12:48:30,704 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2024-11-13 12:48:30,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:30,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:30,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:30,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:30,705 INFO L745 eck$LassoCheckResult]: Stem: 6861#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6816#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 6817#L183-1 [2024-11-13 12:48:30,705 INFO L747 eck$LassoCheckResult]: Loop: 6817#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6931#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 6928#L78 assume !(0 != main_~p1~0#1); 6925#L78-2 assume !(0 != main_~p2~0#1); 6922#L82-1 assume !(0 != main_~p3~0#1); 6918#L86-1 assume !(0 != main_~p4~0#1); 6914#L90-1 assume !(0 != main_~p5~0#1); 6910#L94-1 assume !(0 != main_~p6~0#1); 6907#L98-1 assume !(0 != main_~p7~0#1); 6905#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6903#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6901#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6899#L114-1 assume !(0 != main_~p11~0#1); 6897#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6894#L122-1 assume !(0 != main_~p1~0#1); 6895#L128-1 assume !(0 != main_~p2~0#1); 6970#L133-1 assume !(0 != main_~p3~0#1); 6965#L138-1 assume !(0 != main_~p4~0#1); 6961#L143-1 assume !(0 != main_~p5~0#1); 6957#L148-1 assume !(0 != main_~p6~0#1); 6953#L153-1 assume !(0 != main_~p7~0#1); 6950#L158-1 assume !(0 != main_~p8~0#1); 6946#L163-1 assume !(0 != main_~p9~0#1); 6942#L168-1 assume !(0 != main_~p10~0#1); 6938#L173-1 assume !(0 != main_~p11~0#1); 6935#L178-1 assume !(0 != main_~p12~0#1); 6817#L183-1 [2024-11-13 12:48:30,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-13 12:48:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978862970] [2024-11-13 12:48:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:30,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:30,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1864359912, now seen corresponding path program 1 times [2024-11-13 12:48:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636653028] [2024-11-13 12:48:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636653028] [2024-11-13 12:48:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636653028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937516447] [2024-11-13 12:48:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,743 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:30,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,744 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,783 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2024-11-13 12:48:30,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2024-11-13 12:48:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2024-11-13 12:48:30,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2024-11-13 12:48:30,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2024-11-13 12:48:30,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2024-11-13 12:48:30,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2024-11-13 12:48:30,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:30,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-11-13 12:48:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2024-11-13 12:48:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2024-11-13 12:48:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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) [2024-11-13 12:48:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2024-11-13 12:48:30,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-11-13 12:48:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,998 INFO L424 stractBuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-11-13 12:48:30,998 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 12:48:30,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2024-11-13 12:48:31,025 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2024-11-13 12:48:31,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:31,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:31,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:31,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:31,026 INFO L745 eck$LassoCheckResult]: Stem: 13529#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 13483#L183-1 [2024-11-13 12:48:31,026 INFO L747 eck$LassoCheckResult]: Loop: 13483#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 14067#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 14064#L78 assume !(0 != main_~p1~0#1); 14065#L78-2 assume !(0 != main_~p2~0#1); 14096#L82-1 assume !(0 != main_~p3~0#1); 14042#L86-1 assume !(0 != main_~p4~0#1); 14039#L90-1 assume !(0 != main_~p5~0#1); 14040#L94-1 assume !(0 != main_~p6~0#1); 13738#L98-1 assume !(0 != main_~p7~0#1); 13733#L102-1 assume !(0 != main_~p8~0#1); 13729#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13726#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13723#L114-1 assume !(0 != main_~p11~0#1); 13724#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13970#L122-1 assume !(0 != main_~p1~0#1); 13865#L128-1 assume !(0 != main_~p2~0#1); 13867#L133-1 assume !(0 != main_~p3~0#1); 13954#L138-1 assume !(0 != main_~p4~0#1); 13955#L143-1 assume !(0 != main_~p5~0#1); 14002#L148-1 assume !(0 != main_~p6~0#1); 14091#L153-1 assume !(0 != main_~p7~0#1); 14087#L158-1 assume !(0 != main_~p8~0#1); 14084#L163-1 assume !(0 != main_~p9~0#1); 14080#L168-1 assume !(0 != main_~p10~0#1); 14076#L173-1 assume !(0 != main_~p11~0#1); 14072#L178-1 assume !(0 != main_~p12~0#1); 13483#L183-1 [2024-11-13 12:48:31,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-13 12:48:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613088215] [2024-11-13 12:48:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:31,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:31,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:31,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 276012010, now seen corresponding path program 1 times [2024-11-13 12:48:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565993643] [2024-11-13 12:48:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565993643] [2024-11-13 12:48:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565993643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200306338] [2024-11-13 12:48:31,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:31,074 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:31,075 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:31,136 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2024-11-13 12:48:31,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2024-11-13 12:48:31,232 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2024-11-13 12:48:31,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2024-11-13 12:48:31,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2024-11-13 12:48:31,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2024-11-13 12:48:31,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2024-11-13 12:48:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:31,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-11-13 12:48:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2024-11-13 12:48:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2024-11-13 12:48:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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) [2024-11-13 12:48:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2024-11-13 12:48:31,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-11-13 12:48:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:31,542 INFO L424 stractBuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-11-13 12:48:31,543 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 12:48:31,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2024-11-13 12:48:31,590 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2024-11-13 12:48:31,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:31,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:31,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:31,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:31,592 INFO L745 eck$LassoCheckResult]: Stem: 26660#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 26611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 26612#L183-1 [2024-11-13 12:48:31,593 INFO L747 eck$LassoCheckResult]: Loop: 26612#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27029#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 27025#L78 assume !(0 != main_~p1~0#1); 27026#L78-2 assume !(0 != main_~p2~0#1); 27027#L82-1 assume !(0 != main_~p3~0#1); 27022#L86-1 assume !(0 != main_~p4~0#1); 27018#L90-1 assume !(0 != main_~p5~0#1); 27014#L94-1 assume !(0 != main_~p6~0#1); 27008#L98-1 assume !(0 != main_~p7~0#1); 27002#L102-1 assume !(0 != main_~p8~0#1); 26998#L106-1 assume !(0 != main_~p9~0#1); 26993#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26988#L114-1 assume !(0 != main_~p11~0#1); 26971#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26972#L122-1 assume !(0 != main_~p1~0#1); 26975#L128-1 assume !(0 != main_~p2~0#1); 26965#L133-1 assume !(0 != main_~p3~0#1); 26964#L138-1 assume !(0 != main_~p4~0#1); 26951#L143-1 assume !(0 != main_~p5~0#1); 26953#L148-1 assume !(0 != main_~p6~0#1); 27054#L153-1 assume !(0 != main_~p7~0#1); 27050#L158-1 assume !(0 != main_~p8~0#1); 27046#L163-1 assume !(0 != main_~p9~0#1); 27043#L168-1 assume !(0 != main_~p10~0#1); 27039#L173-1 assume !(0 != main_~p11~0#1); 27035#L178-1 assume !(0 != main_~p12~0#1); 26612#L183-1 [2024-11-13 12:48:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-13 12:48:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706891524] [2024-11-13 12:48:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:31,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:31,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:31,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash -745056344, now seen corresponding path program 1 times [2024-11-13 12:48:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885410741] [2024-11-13 12:48:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:31,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885410741] [2024-11-13 12:48:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885410741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:31,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623653917] [2024-11-13 12:48:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:31,660 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:31,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:31,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:31,661 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:31,832 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2024-11-13 12:48:31,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2024-11-13 12:48:31,935 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2024-11-13 12:48:32,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2024-11-13 12:48:32,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2024-11-13 12:48:32,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2024-11-13 12:48:32,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2024-11-13 12:48:32,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:32,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-11-13 12:48:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2024-11-13 12:48:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2024-11-13 12:48:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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) [2024-11-13 12:48:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2024-11-13 12:48:32,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-11-13 12:48:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:32,560 INFO L424 stractBuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-11-13 12:48:32,564 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 12:48:32,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2024-11-13 12:48:32,706 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2024-11-13 12:48:32,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:32,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:32,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:32,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:32,710 INFO L745 eck$LassoCheckResult]: Stem: 52525#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 52477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 52478#L183-1 [2024-11-13 12:48:32,710 INFO L747 eck$LassoCheckResult]: Loop: 52478#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 52953#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 52950#L78 assume !(0 != main_~p1~0#1); 52951#L78-2 assume !(0 != main_~p2~0#1); 53027#L82-1 assume !(0 != main_~p3~0#1); 53023#L86-1 assume !(0 != main_~p4~0#1); 53020#L90-1 assume !(0 != main_~p5~0#1); 53017#L94-1 assume !(0 != main_~p6~0#1); 53014#L98-1 assume !(0 != main_~p7~0#1); 53010#L102-1 assume !(0 != main_~p8~0#1); 53006#L106-1 assume !(0 != main_~p9~0#1); 53003#L110-1 assume !(0 != main_~p10~0#1); 53001#L114-1 assume !(0 != main_~p11~0#1); 52999#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 52998#L122-1 assume !(0 != main_~p1~0#1); 52996#L128-1 assume !(0 != main_~p2~0#1); 52993#L133-1 assume !(0 != main_~p3~0#1); 52988#L138-1 assume !(0 != main_~p4~0#1); 52984#L143-1 assume !(0 != main_~p5~0#1); 52980#L148-1 assume !(0 != main_~p6~0#1); 52976#L153-1 assume !(0 != main_~p7~0#1); 52972#L158-1 assume !(0 != main_~p8~0#1); 52968#L163-1 assume !(0 != main_~p9~0#1); 52964#L168-1 assume !(0 != main_~p10~0#1); 52961#L173-1 assume !(0 != main_~p11~0#1); 52957#L178-1 assume !(0 != main_~p12~0#1); 52478#L183-1 [2024-11-13 12:48:32,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-13 12:48:32,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:32,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671577994] [2024-11-13 12:48:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:32,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:32,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:32,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2024920022, now seen corresponding path program 1 times [2024-11-13 12:48:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160945942] [2024-11-13 12:48:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:32,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160945942] [2024-11-13 12:48:32,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160945942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:32,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359482064] [2024-11-13 12:48:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:32,789 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 12:48:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:32,789 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-13 12:48:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:32,969 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2024-11-13 12:48:32,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2024-11-13 12:48:33,149 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2024-11-13 12:48:33,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2024-11-13 12:48:33,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2024-11-13 12:48:33,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2024-11-13 12:48:33,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2024-11-13 12:48:33,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:48:33,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-11-13 12:48:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2024-11-13 12:48:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2024-11-13 12:48:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 33794 states have (on average 1.4242173166834349) internal successors, (48130), 33793 states have internal predecessors, (48130), 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) [2024-11-13 12:48:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2024-11-13 12:48:34,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-11-13 12:48:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:34,131 INFO L424 stractBuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-11-13 12:48:34,131 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 12:48:34,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2024-11-13 12:48:34,395 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2024-11-13 12:48:34,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:48:34,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:48:34,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:48:34,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 12:48:34,400 INFO L745 eck$LassoCheckResult]: Stem: 103488#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 103432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 103433#L183-1 [2024-11-13 12:48:34,404 INFO L747 eck$LassoCheckResult]: Loop: 103433#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103587#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 103584#L78 assume !(0 != main_~p1~0#1); 103581#L78-2 assume !(0 != main_~p2~0#1); 103578#L82-1 assume !(0 != main_~p3~0#1); 103574#L86-1 assume !(0 != main_~p4~0#1); 103570#L90-1 assume !(0 != main_~p5~0#1); 103566#L94-1 assume !(0 != main_~p6~0#1); 103562#L98-1 assume !(0 != main_~p7~0#1); 103558#L102-1 assume !(0 != main_~p8~0#1); 103554#L106-1 assume !(0 != main_~p9~0#1); 103551#L110-1 assume !(0 != main_~p10~0#1); 103548#L114-1 assume !(0 != main_~p11~0#1); 103545#L118-1 assume !(0 != main_~p12~0#1); 103542#L122-1 assume !(0 != main_~p1~0#1); 103543#L128-1 assume !(0 != main_~p2~0#1); 103626#L133-1 assume !(0 != main_~p3~0#1); 103621#L138-1 assume !(0 != main_~p4~0#1); 103617#L143-1 assume !(0 != main_~p5~0#1); 103613#L148-1 assume !(0 != main_~p6~0#1); 103609#L153-1 assume !(0 != main_~p7~0#1); 103605#L158-1 assume !(0 != main_~p8~0#1); 103601#L163-1 assume !(0 != main_~p9~0#1); 103597#L168-1 assume !(0 != main_~p10~0#1); 103594#L173-1 assume !(0 != main_~p11~0#1); 103590#L178-1 assume !(0 != main_~p12~0#1); 103433#L183-1 [2024-11-13 12:48:34,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-13 12:48:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143667290] [2024-11-13 12:48:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1683241260, now seen corresponding path program 1 times [2024-11-13 12:48:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162331742] [2024-11-13 12:48:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:34,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash -957010322, now seen corresponding path program 1 times [2024-11-13 12:48:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289992343] [2024-11-13 12:48:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:34,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:48:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:35,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:48:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:48:35,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 12:48:35 BoogieIcfgContainer [2024-11-13 12:48:35,383 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 12:48:35,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:48:35,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:48:35,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:48:35,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:29" (3/4) ... [2024-11-13 12:48:35,446 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 12:48:35,493 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:48:35,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:48:35,498 INFO L158 Benchmark]: Toolchain (without parser) took 7045.98ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 93.2MB in the beginning and 218.3MB in the end (delta: -125.1MB). Peak memory consumption was 319.7MB. Max. memory is 16.1GB. [2024-11-13 12:48:35,498 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:48:35,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 81.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:48:35,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:48:35,499 INFO L158 Benchmark]: Boogie Preprocessor took 58.21ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:48:35,501 INFO L158 Benchmark]: RCFGBuilder took 374.86ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 64.1MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:48:35,502 INFO L158 Benchmark]: BuchiAutomizer took 6172.71ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 64.1MB in the beginning and 159.2MB in the end (delta: -95.0MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. [2024-11-13 12:48:35,502 INFO L158 Benchmark]: Witness Printer took 113.12ms. Allocated memory is still 478.2MB. Free memory was 159.2MB in the beginning and 218.3MB in the end (delta: -59.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-13 12:48:35,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 81.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.21ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 374.86ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 64.1MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6172.71ms. Allocated memory was 117.4MB in the beginning and 478.2MB in the end (delta: 360.7MB). Free memory was 64.1MB in the beginning and 159.2MB in the end (delta: -95.0MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. * Witness Printer took 113.12ms. Allocated memory is still 478.2MB. Free memory was 159.2MB in the beginning and 218.3MB in the end (delta: -59.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 1550 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 956 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 12:48:35,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ceef225-ac70-4e8a-8c4b-97c99ed90334/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)