./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9.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_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/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_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/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_2df7b8c9-40de-4402-9443-215fbfe5b42c/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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:28:34,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:28:34,339 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 13:28:34,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:28:34,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:28:34,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:28:34,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:28:34,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:28:34,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:28:34,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:28:34,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:28:34,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:28:34,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:28:34,409 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 13:28:34,409 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 13:28:34,409 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 13:28:34,409 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 13:28:34,409 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 13:28:34,409 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 13:28:34,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 13:28:34,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:28:34,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:28:34,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:28:34,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:28:34,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:28:34,412 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 13:28:34,412 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_2df7b8c9-40de-4402-9443-215fbfe5b42c/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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2024-11-13 13:28:34,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:28:34,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:28:34,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:28:34,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:28:34,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:28:34,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_9.c Unable to find full path for "g++" [2024-11-13 13:28:37,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:28:37,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:28:37,501 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/sv-benchmarks/c/locks/test_locks_9.c [2024-11-13 13:28:37,513 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/data/ef33f70a2/ecc6cfb86caf4456b783a956e5202d09/FLAG661b5db40 [2024-11-13 13:28:37,714 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/data/ef33f70a2/ecc6cfb86caf4456b783a956e5202d09 [2024-11-13 13:28:37,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:28:37,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:28:37,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:37,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:28:37,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:28:37,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:37" (1/1) ... [2024-11-13 13:28:37,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f10e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:37, skipping insertion in model container [2024-11-13 13:28:37,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:37" (1/1) ... [2024-11-13 13:28:37,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:28:37,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:38,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:28:38,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:38,058 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:28:38,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38 WrapperNode [2024-11-13 13:28:38,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:38,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:38,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:28:38,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:28:38,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,100 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-11-13 13:28:38,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:38,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:28:38,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:28:38,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:28:38,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,144 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 13:28:38,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:28:38,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:28:38,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:28:38,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:28:38,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (1/1) ... [2024-11-13 13:28:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:28:38,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:38,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:28:38,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 13:28:38,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:28:38,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:28:38,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:28:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:28:38,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:28:38,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:28:38,676 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-13 13:28:38,676 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:28:38,690 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:28:38,690 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:28:38,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:38 BoogieIcfgContainer [2024-11-13 13:28:38,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:28:38,692 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 13:28:38,692 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 13:28:38,700 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 13:28:38,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:28:38,701 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 01:28:37" (1/3) ... [2024-11-13 13:28:38,703 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e411d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:28:38, skipping insertion in model container [2024-11-13 13:28:38,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:28:38,703 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:38" (2/3) ... [2024-11-13 13:28:38,704 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e411d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:28:38, skipping insertion in model container [2024-11-13 13:28:38,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:28:38,704 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:38" (3/3) ... [2024-11-13 13:28:38,706 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2024-11-13 13:28:38,782 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 13:28:38,783 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 13:28:38,783 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 13:28:38,783 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 13:28:38,783 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 13:28:38,783 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 13:28:38,785 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 13:28:38,785 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 13:28:38,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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 13:28:38,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-13 13:28:38,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:38,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:38,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:38,823 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] [2024-11-13 13:28:38,823 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 13:28:38,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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 13:28:38,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-13 13:28:38,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:38,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:38,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:38,830 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] [2024-11-13 13:28:38,842 INFO L745 eck$LassoCheckResult]: Stem: 32#$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(15, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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_~cond~0#1; 12#L141-1true [2024-11-13 13:28:38,844 INFO L747 eck$LassoCheckResult]: Loop: 12#L141-1true assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 36#L40true 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; 3#L63true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 19#L63-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L67-1true assume !(0 != main_~p3~0#1); 23#L71-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 29#L75-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 14#L79-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 37#L83-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 8#L87-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L91-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 34#L95-1true assume !(0 != main_~p1~0#1); 21#L101-1true assume !(0 != main_~p2~0#1); 9#L106-1true assume !(0 != main_~p3~0#1); 10#L111-1true assume !(0 != main_~p4~0#1); 33#L116-1true assume !(0 != main_~p5~0#1); 5#L121-1true assume !(0 != main_~p6~0#1); 17#L126-1true assume !(0 != main_~p7~0#1); 30#L131-1true assume !(0 != main_~p8~0#1); 18#L136-1true assume !(0 != main_~p9~0#1); 12#L141-1true [2024-11-13 13:28:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 13:28:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:38,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670968650] [2024-11-13 13:28:38,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:38,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2024-11-13 13:28:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374013632] [2024-11-13 13:28:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:39,181 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 13:28:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374013632] [2024-11-13 13:28:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374013632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563609532] [2024-11-13 13:28:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:39,188 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:39,236 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:39,314 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2024-11-13 13:28:39,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 117 transitions. [2024-11-13 13:28:39,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-11-13 13:28:39,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 93 transitions. [2024-11-13 13:28:39,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-13 13:28:39,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-13 13:28:39,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2024-11-13 13:28:39,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:39,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-13 13:28:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2024-11-13 13:28:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 13:28:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 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 13:28:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2024-11-13 13:28:39,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-13 13:28:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:39,388 INFO L424 stractBuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-13 13:28:39,389 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 13:28:39,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2024-11-13 13:28:39,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-11-13 13:28:39,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:39,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:39,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:39,391 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] [2024-11-13 13:28:39,392 INFO L745 eck$LassoCheckResult]: Stem: 147#$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(15, 2);call #Ultimate.allocInit(12, 3); 122#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_~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_~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_~cond~0#1; 123#L141-1 [2024-11-13 13:28:39,392 INFO L747 eck$LassoCheckResult]: Loop: 123#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 130#L40 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; 149#L63 assume !(0 != main_~p1~0#1); 139#L63-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 140#L67-1 assume !(0 != main_~p3~0#1); 144#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 131#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 132#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 124#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 115#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 116#L95-1 assume !(0 != main_~p1~0#1); 150#L101-1 assume !(0 != main_~p2~0#1); 170#L106-1 assume !(0 != main_~p3~0#1); 167#L111-1 assume !(0 != main_~p4~0#1); 166#L116-1 assume !(0 != main_~p5~0#1); 164#L121-1 assume !(0 != main_~p6~0#1); 134#L126-1 assume !(0 != main_~p7~0#1); 135#L131-1 assume !(0 != main_~p8~0#1); 137#L136-1 assume !(0 != main_~p9~0#1); 123#L141-1 [2024-11-13 13:28:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 13:28:39,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282102552] [2024-11-13 13:28:39,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2024-11-13 13:28:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797091575] [2024-11-13 13:28:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:39,513 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 13:28:39,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:39,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797091575] [2024-11-13 13:28:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797091575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:39,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722893707] [2024-11-13 13:28:39,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:39,514 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:39,518 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:39,564 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2024-11-13 13:28:39,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2024-11-13 13:28:39,571 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2024-11-13 13:28:39,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2024-11-13 13:28:39,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2024-11-13 13:28:39,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2024-11-13 13:28:39,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2024-11-13 13:28:39,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:39,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-13 13:28:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2024-11-13 13:28:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 13:28:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 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 13:28:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2024-11-13 13:28:39,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-13 13:28:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:39,608 INFO L424 stractBuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-13 13:28:39,609 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 13:28:39,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2024-11-13 13:28:39,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2024-11-13 13:28:39,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:39,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:39,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:39,616 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] [2024-11-13 13:28:39,616 INFO L745 eck$LassoCheckResult]: Stem: 324#$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(15, 2);call #Ultimate.allocInit(12, 3); 301#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_~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_~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_~cond~0#1; 302#L141-1 [2024-11-13 13:28:39,616 INFO L747 eck$LassoCheckResult]: Loop: 302#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 334#L40 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; 331#L63 assume !(0 != main_~p1~0#1); 332#L63-2 assume !(0 != main_~p2~0#1); 374#L67-1 assume !(0 != main_~p3~0#1); 373#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 372#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 371#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 370#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 369#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 368#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 365#L95-1 assume !(0 != main_~p1~0#1); 362#L101-1 assume !(0 != main_~p2~0#1); 359#L106-1 assume !(0 != main_~p3~0#1); 356#L111-1 assume !(0 != main_~p4~0#1); 355#L116-1 assume !(0 != main_~p5~0#1); 353#L121-1 assume !(0 != main_~p6~0#1); 346#L126-1 assume !(0 != main_~p7~0#1); 343#L131-1 assume !(0 != main_~p8~0#1); 339#L136-1 assume !(0 != main_~p9~0#1); 302#L141-1 [2024-11-13 13:28:39,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 13:28:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459934312] [2024-11-13 13:28:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2024-11-13 13:28:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100143436] [2024-11-13 13:28:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:39,823 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 13:28:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100143436] [2024-11-13 13:28:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100143436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933557113] [2024-11-13 13:28:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:39,824 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:39,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:39,825 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:39,874 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2024-11-13 13:28:39,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2024-11-13 13:28:39,877 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2024-11-13 13:28:39,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2024-11-13 13:28:39,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2024-11-13 13:28:39,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2024-11-13 13:28:39,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2024-11-13 13:28:39,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:39,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-13 13:28:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2024-11-13 13:28:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-13 13:28:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 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 13:28:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2024-11-13 13:28:39,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-13 13:28:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:39,901 INFO L424 stractBuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-13 13:28:39,901 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 13:28:39,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2024-11-13 13:28:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2024-11-13 13:28:39,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:39,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:39,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:39,905 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] [2024-11-13 13:28:39,905 INFO L745 eck$LassoCheckResult]: Stem: 672#$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(15, 2);call #Ultimate.allocInit(12, 3); 643#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_~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_~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_~cond~0#1; 644#L141-1 [2024-11-13 13:28:39,905 INFO L747 eck$LassoCheckResult]: Loop: 644#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 710#L40 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; 708#L63 assume !(0 != main_~p1~0#1); 704#L63-2 assume !(0 != main_~p2~0#1); 702#L67-1 assume !(0 != main_~p3~0#1); 699#L71-1 assume !(0 != main_~p4~0#1); 697#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 695#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 693#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 691#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 689#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 686#L95-1 assume !(0 != main_~p1~0#1); 687#L101-1 assume !(0 != main_~p2~0#1); 736#L106-1 assume !(0 != main_~p3~0#1); 731#L111-1 assume !(0 != main_~p4~0#1); 728#L116-1 assume !(0 != main_~p5~0#1); 726#L121-1 assume !(0 != main_~p6~0#1); 721#L126-1 assume !(0 != main_~p7~0#1); 718#L131-1 assume !(0 != main_~p8~0#1); 714#L136-1 assume !(0 != main_~p9~0#1); 644#L141-1 [2024-11-13 13:28:39,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 13:28:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039076676] [2024-11-13 13:28:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:39,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:39,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2024-11-13 13:28:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:39,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78007390] [2024-11-13 13:28:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:39,995 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 13:28:39,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:39,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78007390] [2024-11-13 13:28:39,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78007390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429737496] [2024-11-13 13:28:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:39,998 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:39,999 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:40,038 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2024-11-13 13:28:40,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2024-11-13 13:28:40,046 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2024-11-13 13:28:40,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2024-11-13 13:28:40,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2024-11-13 13:28:40,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2024-11-13 13:28:40,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2024-11-13 13:28:40,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:40,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-13 13:28:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2024-11-13 13:28:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-13 13:28:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 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 13:28:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2024-11-13 13:28:40,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-13 13:28:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:40,102 INFO L424 stractBuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-13 13:28:40,102 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 13:28:40,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2024-11-13 13:28:40,108 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2024-11-13 13:28:40,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:40,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:40,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:40,109 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] [2024-11-13 13:28:40,109 INFO L745 eck$LassoCheckResult]: Stem: 1334#$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(15, 2);call #Ultimate.allocInit(12, 3); 1305#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_~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_~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_~cond~0#1; 1306#L141-1 [2024-11-13 13:28:40,109 INFO L747 eck$LassoCheckResult]: Loop: 1306#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 1400#L40 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; 1396#L63 assume !(0 != main_~p1~0#1); 1389#L63-2 assume !(0 != main_~p2~0#1); 1384#L67-1 assume !(0 != main_~p3~0#1); 1377#L71-1 assume !(0 != main_~p4~0#1); 1370#L75-1 assume !(0 != main_~p5~0#1); 1371#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1361#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1362#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1353#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1354#L95-1 assume !(0 != main_~p1~0#1); 1433#L101-1 assume !(0 != main_~p2~0#1); 1430#L106-1 assume !(0 != main_~p3~0#1); 1425#L111-1 assume !(0 != main_~p4~0#1); 1423#L116-1 assume !(0 != main_~p5~0#1); 1421#L121-1 assume !(0 != main_~p6~0#1); 1416#L126-1 assume !(0 != main_~p7~0#1); 1413#L131-1 assume !(0 != main_~p8~0#1); 1409#L136-1 assume !(0 != main_~p9~0#1); 1306#L141-1 [2024-11-13 13:28:40,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 13:28:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704498557] [2024-11-13 13:28:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2024-11-13 13:28:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207863155] [2024-11-13 13:28:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:40,188 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 13:28:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207863155] [2024-11-13 13:28:40,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207863155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:40,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:40,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058194708] [2024-11-13 13:28:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:40,190 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:40,191 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:40,214 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2024-11-13 13:28:40,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2024-11-13 13:28:40,223 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2024-11-13 13:28:40,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2024-11-13 13:28:40,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2024-11-13 13:28:40,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2024-11-13 13:28:40,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2024-11-13 13:28:40,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:40,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-13 13:28:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2024-11-13 13:28:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2024-11-13 13:28:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 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 13:28:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2024-11-13 13:28:40,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-13 13:28:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:40,280 INFO L424 stractBuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-13 13:28:40,280 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 13:28:40,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2024-11-13 13:28:40,289 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2024-11-13 13:28:40,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:40,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:40,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:40,290 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] [2024-11-13 13:28:40,290 INFO L745 eck$LassoCheckResult]: Stem: 2622#$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(15, 2);call #Ultimate.allocInit(12, 3); 2594#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_~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_~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_~cond~0#1; 2595#L141-1 [2024-11-13 13:28:40,290 INFO L747 eck$LassoCheckResult]: Loop: 2595#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 2791#L40 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; 2788#L63 assume !(0 != main_~p1~0#1); 2789#L63-2 assume !(0 != main_~p2~0#1); 2772#L67-1 assume !(0 != main_~p3~0#1); 2773#L71-1 assume !(0 != main_~p4~0#1); 2752#L75-1 assume !(0 != main_~p5~0#1); 2754#L79-1 assume !(0 != main_~p6~0#1); 2736#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2737#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2720#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2721#L95-1 assume !(0 != main_~p1~0#1); 2814#L101-1 assume !(0 != main_~p2~0#1); 2813#L106-1 assume !(0 != main_~p3~0#1); 2810#L111-1 assume !(0 != main_~p4~0#1); 2808#L116-1 assume !(0 != main_~p5~0#1); 2806#L121-1 assume !(0 != main_~p6~0#1); 2802#L126-1 assume !(0 != main_~p7~0#1); 2799#L131-1 assume !(0 != main_~p8~0#1); 2795#L136-1 assume !(0 != main_~p9~0#1); 2595#L141-1 [2024-11-13 13:28:40,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 13:28:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453721460] [2024-11-13 13:28:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2024-11-13 13:28:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206227413] [2024-11-13 13:28:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:40,355 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 13:28:40,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206227413] [2024-11-13 13:28:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206227413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612905028] [2024-11-13 13:28:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:40,357 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:40,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:40,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:40,358 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:40,394 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2024-11-13 13:28:40,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2024-11-13 13:28:40,423 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2024-11-13 13:28:40,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2024-11-13 13:28:40,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2024-11-13 13:28:40,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2024-11-13 13:28:40,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2024-11-13 13:28:40,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:40,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-13 13:28:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2024-11-13 13:28:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2024-11-13 13:28:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 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 13:28:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2024-11-13 13:28:40,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-13 13:28:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:40,547 INFO L424 stractBuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-13 13:28:40,550 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 13:28:40,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2024-11-13 13:28:40,564 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2024-11-13 13:28:40,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:40,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:40,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:40,566 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] [2024-11-13 13:28:40,566 INFO L745 eck$LassoCheckResult]: Stem: 5151#$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(15, 2);call #Ultimate.allocInit(12, 3); 5116#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_~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_~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_~cond~0#1; 5117#L141-1 [2024-11-13 13:28:40,566 INFO L747 eck$LassoCheckResult]: Loop: 5117#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 5515#L40 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; 5512#L63 assume !(0 != main_~p1~0#1); 5509#L63-2 assume !(0 != main_~p2~0#1); 5503#L67-1 assume !(0 != main_~p3~0#1); 5495#L71-1 assume !(0 != main_~p4~0#1); 5489#L75-1 assume !(0 != main_~p5~0#1); 5483#L79-1 assume !(0 != main_~p6~0#1); 5481#L83-1 assume !(0 != main_~p7~0#1); 5478#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5249#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5250#L95-1 assume !(0 != main_~p1~0#1); 5467#L101-1 assume !(0 != main_~p2~0#1); 5469#L106-1 assume !(0 != main_~p3~0#1); 5455#L111-1 assume !(0 != main_~p4~0#1); 5456#L116-1 assume !(0 != main_~p5~0#1); 5443#L121-1 assume !(0 != main_~p6~0#1); 5444#L126-1 assume !(0 != main_~p7~0#1); 5522#L131-1 assume !(0 != main_~p8~0#1); 5519#L136-1 assume !(0 != main_~p9~0#1); 5117#L141-1 [2024-11-13 13:28:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-13 13:28:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761699700] [2024-11-13 13:28:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:40,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2024-11-13 13:28:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141844867] [2024-11-13 13:28:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:40,637 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 13:28:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:40,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141844867] [2024-11-13 13:28:40,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141844867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:40,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:40,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098097625] [2024-11-13 13:28:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:40,642 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:40,643 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:40,692 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2024-11-13 13:28:40,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2024-11-13 13:28:40,731 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2024-11-13 13:28:40,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2024-11-13 13:28:40,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2024-11-13 13:28:40,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2024-11-13 13:28:40,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2024-11-13 13:28:40,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:40,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-13 13:28:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2024-11-13 13:28:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2024-11-13 13:28:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 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 13:28:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2024-11-13 13:28:40,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-13 13:28:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:40,869 INFO L424 stractBuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-13 13:28:40,870 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 13:28:40,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2024-11-13 13:28:40,893 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2024-11-13 13:28:40,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:40,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:40,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:40,894 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] [2024-11-13 13:28:40,895 INFO L745 eck$LassoCheckResult]: Stem: 10085#$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(15, 2);call #Ultimate.allocInit(12, 3); 10054#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_~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_~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_~cond~0#1; 10055#L141-1 [2024-11-13 13:28:40,895 INFO L747 eck$LassoCheckResult]: Loop: 10055#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 10198#L40 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; 10199#L63 assume !(0 != main_~p1~0#1); 10176#L63-2 assume !(0 != main_~p2~0#1); 10178#L67-1 assume !(0 != main_~p3~0#1); 10154#L71-1 assume !(0 != main_~p4~0#1); 10156#L75-1 assume !(0 != main_~p5~0#1); 10134#L79-1 assume !(0 != main_~p6~0#1); 10136#L83-1 assume !(0 != main_~p7~0#1); 10254#L87-1 assume !(0 != main_~p8~0#1); 10253#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10249#L95-1 assume !(0 != main_~p1~0#1); 10245#L101-1 assume !(0 != main_~p2~0#1); 10242#L106-1 assume !(0 != main_~p3~0#1); 10237#L111-1 assume !(0 != main_~p4~0#1); 10233#L116-1 assume !(0 != main_~p5~0#1); 10230#L121-1 assume !(0 != main_~p6~0#1); 10227#L126-1 assume !(0 != main_~p7~0#1); 10228#L131-1 assume !(0 != main_~p8~0#1); 10213#L136-1 assume !(0 != main_~p9~0#1); 10055#L141-1 [2024-11-13 13:28:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-13 13:28:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628400222] [2024-11-13 13:28:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:40,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2024-11-13 13:28:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:40,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793404357] [2024-11-13 13:28:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:41,003 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 13:28:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793404357] [2024-11-13 13:28:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793404357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:41,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:28:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928382380] [2024-11-13 13:28:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:41,004 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:28:41,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:41,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:41,005 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 13:28:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:41,069 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2024-11-13 13:28:41,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2024-11-13 13:28:41,135 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2024-11-13 13:28:41,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2024-11-13 13:28:41,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2024-11-13 13:28:41,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2024-11-13 13:28:41,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2024-11-13 13:28:41,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:28:41,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-13 13:28:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2024-11-13 13:28:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2024-11-13 13:28:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 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 13:28:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2024-11-13 13:28:41,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-13 13:28:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:41,407 INFO L424 stractBuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-13 13:28:41,409 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 13:28:41,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2024-11-13 13:28:41,442 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2024-11-13 13:28:41,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:28:41,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:28:41,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:28:41,444 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] [2024-11-13 13:28:41,444 INFO L745 eck$LassoCheckResult]: Stem: 19758#$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(15, 2);call #Ultimate.allocInit(12, 3); 19728#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_~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_~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_~cond~0#1; 19729#L141-1 [2024-11-13 13:28:41,445 INFO L747 eck$LassoCheckResult]: Loop: 19729#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 19922#L40 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; 19919#L63 assume !(0 != main_~p1~0#1); 19920#L63-2 assume !(0 != main_~p2~0#1); 19899#L67-1 assume !(0 != main_~p3~0#1); 19900#L71-1 assume !(0 != main_~p4~0#1); 19883#L75-1 assume !(0 != main_~p5~0#1); 19885#L79-1 assume !(0 != main_~p6~0#1); 19859#L83-1 assume !(0 != main_~p7~0#1); 19861#L87-1 assume !(0 != main_~p8~0#1); 19835#L91-1 assume !(0 != main_~p9~0#1); 19837#L95-1 assume !(0 != main_~p1~0#1); 19946#L101-1 assume !(0 != main_~p2~0#1); 19945#L106-1 assume !(0 != main_~p3~0#1); 19942#L111-1 assume !(0 != main_~p4~0#1); 19940#L116-1 assume !(0 != main_~p5~0#1); 19938#L121-1 assume !(0 != main_~p6~0#1); 19934#L126-1 assume !(0 != main_~p7~0#1); 19930#L131-1 assume !(0 != main_~p8~0#1); 19926#L136-1 assume !(0 != main_~p9~0#1); 19729#L141-1 [2024-11-13 13:28:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-13 13:28:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387683746] [2024-11-13 13:28:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2024-11-13 13:28:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859423339] [2024-11-13 13:28:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:41,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2032313065, now seen corresponding path program 1 times [2024-11-13 13:28:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051468314] [2024-11-13 13:28:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:41,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:42,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:42,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 01:28:42 BoogieIcfgContainer [2024-11-13 13:28:42,260 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 13:28:42,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:28:42,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:28:42,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:28:42,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:38" (3/4) ... [2024-11-13 13:28:42,263 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 13:28:42,306 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:28:42,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:28:42,307 INFO L158 Benchmark]: Toolchain (without parser) took 4587.41ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 93.1MB in the beginning and 92.0MB in the end (delta: 1.1MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,308 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 167.8MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:42,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.96ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 81.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:42,313 INFO L158 Benchmark]: Boogie Preprocessor took 71.05ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,315 INFO L158 Benchmark]: RCFGBuilder took 516.34ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 65.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,316 INFO L158 Benchmark]: BuchiAutomizer took 3567.52ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 65.7MB in the beginning and 94.6MB in the end (delta: -28.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,317 INFO L158 Benchmark]: Witness Printer took 46.02ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:28:42,321 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.53ms. Allocated memory is still 167.8MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.96ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 81.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.05ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 516.34ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 65.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3567.52ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 65.7MB in the beginning and 94.6MB in the end (delta: -28.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 46.02ms. Allocated memory is still 184.5MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s 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, 299 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 937 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 582 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 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: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 13:28:42,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2df7b8c9-40de-4402-9443-215fbfe5b42c/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)