./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu --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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:14,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:14,725 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:35:14,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:14,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:14,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:14,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:14,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:14,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:14,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:14,757 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:14,758 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:35:14,758 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:35:14,759 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:35:14,760 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:35:14,760 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:35:14,761 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:35:14,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:14,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:35:14,762 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:14,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:14,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:14,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:14,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:35:14,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:35:14,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:35:14,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:35:14,771 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:14,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:35:14,771 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:35:14,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:14,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:14,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:14,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:14,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:35:14,775 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:35:14,775 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2023-11-19 07:35:15,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:15,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:15,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:15,176 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:15,177 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:15,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/locks/test_locks_5.c [2023-11-19 07:35:18,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:18,499 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:18,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/sv-benchmarks/c/locks/test_locks_5.c [2023-11-19 07:35:18,510 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/data/79454f88e/90048373b44f40b3af16c269fd4dbdd8/FLAGf939bff3d [2023-11-19 07:35:18,542 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/data/79454f88e/90048373b44f40b3af16c269fd4dbdd8 [2023-11-19 07:35:18,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:18,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:18,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:18,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:18,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:18,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff614e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18, skipping insertion in model container [2023-11-19 07:35:18,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:18,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:18,795 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:18,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:18,837 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:18,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18 WrapperNode [2023-11-19 07:35:18,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:18,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:18,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:18,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:18,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,894 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-19 07:35:18,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:18,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:18,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:18,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:18,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:18,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:18,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:18,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:18,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (1/1) ... [2023-11-19 07:35:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:35:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:19,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:19,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:19,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:19,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:35:19,128 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:19,131 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:19,296 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:19,304 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:19,304 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:35:19,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:19 BoogieIcfgContainer [2023-11-19 07:35:19,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:19,310 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:35:19,310 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:35:19,314 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:35:19,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:35:19,315 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:35:18" (1/3) ... [2023-11-19 07:35:19,317 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a59ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:35:19, skipping insertion in model container [2023-11-19 07:35:19,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:35:19,317 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:18" (2/3) ... [2023-11-19 07:35:19,318 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a59ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:35:19, skipping insertion in model container [2023-11-19 07:35:19,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:35:19,318 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:19" (3/3) ... [2023-11-19 07:35:19,319 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2023-11-19 07:35:19,386 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:35:19,386 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:35:19,386 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:35:19,387 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:35:19,387 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:35:19,387 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:35:19,388 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:35:19,389 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:35:19,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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) [2023-11-19 07:35:19,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2023-11-19 07:35:19,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:19,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:19,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:19,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:19,426 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:35:19,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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) [2023-11-19 07:35:19,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2023-11-19 07:35:19,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:19,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:19,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:19,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:19,445 INFO L748 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~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_~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_~cond~0#1; 12#L85-1true [2023-11-19 07:35:19,446 INFO L750 eck$LassoCheckResult]: Loop: 12#L85-1true assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 23#L28true 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; 13#L43true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L43-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 19#L47-1true assume !(0 != main_~p3~0#1); 7#L51-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 8#L55-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 9#L59-1true assume !(0 != main_~p1~0#1); 15#L65-1true assume !(0 != main_~p2~0#1); 21#L70-1true assume !(0 != main_~p3~0#1); 22#L75-1true assume !(0 != main_~p4~0#1); 11#L80-1true assume !(0 != main_~p5~0#1); 12#L85-1true [2023-11-19 07:35:19,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 07:35:19,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676487372] [2023-11-19 07:35:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:19,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:19,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:19,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2089480461, now seen corresponding path program 1 times [2023-11-19 07:35:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074664215] [2023-11-19 07:35:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074664215] [2023-11-19 07:35:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074664215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:19,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:19,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415340072] [2023-11-19 07:35:19,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:19,745 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:19,784 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-19 07:35:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:19,841 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2023-11-19 07:35:19,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2023-11-19 07:35:19,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2023-11-19 07:35:19,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 35 states and 53 transitions. [2023-11-19 07:35:19,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-11-19 07:35:19,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-11-19 07:35:19,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2023-11-19 07:35:19,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:19,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-11-19 07:35:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2023-11-19 07:35:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-19 07:35:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 34 states have internal predecessors, (53), 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) [2023-11-19 07:35:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-11-19 07:35:19,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-11-19 07:35:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:19,885 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-11-19 07:35:19,886 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:35:19,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2023-11-19 07:35:19,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2023-11-19 07:35:19,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:19,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:19,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:19,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:19,889 INFO L748 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 91#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_~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_~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_~cond~0#1; 92#L85-1 [2023-11-19 07:35:19,889 INFO L750 eck$LassoCheckResult]: Loop: 92#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 100#L28 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; 101#L43 assume !(0 != main_~p1~0#1); 84#L43-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 85#L47-1 assume !(0 != main_~p3~0#1); 93#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 94#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 95#L59-1 assume !(0 != main_~p1~0#1); 86#L65-1 assume !(0 != main_~p2~0#1); 87#L70-1 assume !(0 != main_~p3~0#1); 97#L75-1 assume !(0 != main_~p4~0#1); 107#L80-1 assume !(0 != main_~p5~0#1); 92#L85-1 [2023-11-19 07:35:19,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-19 07:35:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900313037] [2023-11-19 07:35:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:19,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:19,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:19,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1812459825, now seen corresponding path program 1 times [2023-11-19 07:35:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822530669] [2023-11-19 07:35:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:19,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822530669] [2023-11-19 07:35:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822530669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:19,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432497695] [2023-11-19 07:35:19,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:19,952 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:19,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:19,954 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-19 07:35:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:19,972 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2023-11-19 07:35:19,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2023-11-19 07:35:19,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2023-11-19 07:35:19,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 98 transitions. [2023-11-19 07:35:19,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2023-11-19 07:35:19,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-11-19 07:35:19,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2023-11-19 07:35:19,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:19,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2023-11-19 07:35:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2023-11-19 07:35:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-19 07:35:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 65 states have internal predecessors, (98), 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) [2023-11-19 07:35:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2023-11-19 07:35:19,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2023-11-19 07:35:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:19,989 INFO L428 stractBuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2023-11-19 07:35:19,990 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:35:19,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 98 transitions. [2023-11-19 07:35:19,992 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2023-11-19 07:35:19,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:19,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:19,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:19,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:19,993 INFO L748 eck$LassoCheckResult]: Stem: 209#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 198#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_~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_~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_~cond~0#1; 199#L85-1 [2023-11-19 07:35:19,994 INFO L750 eck$LassoCheckResult]: Loop: 199#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 226#L28 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; 224#L43 assume !(0 != main_~p1~0#1); 221#L43-2 assume !(0 != main_~p2~0#1); 220#L47-1 assume !(0 != main_~p3~0#1); 218#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 216#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 215#L59-1 assume !(0 != main_~p1~0#1); 210#L65-1 assume !(0 != main_~p2~0#1); 211#L70-1 assume !(0 != main_~p3~0#1); 235#L75-1 assume !(0 != main_~p4~0#1); 231#L80-1 assume !(0 != main_~p5~0#1); 199#L85-1 [2023-11-19 07:35:19,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-19 07:35:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588230251] [2023-11-19 07:35:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:20,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1802449101, now seen corresponding path program 1 times [2023-11-19 07:35:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537344862] [2023-11-19 07:35:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537344862] [2023-11-19 07:35:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537344862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:20,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83429989] [2023-11-19 07:35:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:20,052 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:20,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:20,053 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-19 07:35:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:20,071 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2023-11-19 07:35:20,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 182 transitions. [2023-11-19 07:35:20,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2023-11-19 07:35:20,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 182 transitions. [2023-11-19 07:35:20,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-19 07:35:20,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-19 07:35:20,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 182 transitions. [2023-11-19 07:35:20,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:20,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2023-11-19 07:35:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 182 transitions. [2023-11-19 07:35:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-19 07:35:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 125 states have internal predecessors, (182), 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) [2023-11-19 07:35:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2023-11-19 07:35:20,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2023-11-19 07:35:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:20,095 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2023-11-19 07:35:20,095 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:35:20,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 182 transitions. [2023-11-19 07:35:20,098 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2023-11-19 07:35:20,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:20,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:20,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:20,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:20,100 INFO L748 eck$LassoCheckResult]: Stem: 408#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 395#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_~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_~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_~cond~0#1; 396#L85-1 [2023-11-19 07:35:20,100 INFO L750 eck$LassoCheckResult]: Loop: 396#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 445#L28 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; 442#L43 assume !(0 != main_~p1~0#1); 438#L43-2 assume !(0 != main_~p2~0#1); 436#L47-1 assume !(0 != main_~p3~0#1); 422#L51-1 assume !(0 != main_~p4~0#1); 423#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 463#L59-1 assume !(0 != main_~p1~0#1); 461#L65-1 assume !(0 != main_~p2~0#1); 460#L70-1 assume !(0 != main_~p3~0#1); 454#L75-1 assume !(0 != main_~p4~0#1); 451#L80-1 assume !(0 != main_~p5~0#1); 396#L85-1 [2023-11-19 07:35:20,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-19 07:35:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602998043] [2023-11-19 07:35:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:20,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -27441739, now seen corresponding path program 1 times [2023-11-19 07:35:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371248400] [2023-11-19 07:35:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371248400] [2023-11-19 07:35:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371248400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:20,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058014209] [2023-11-19 07:35:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:20,153 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:20,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:20,154 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. cyclomatic complexity: 64 Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-19 07:35:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:20,173 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2023-11-19 07:35:20,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 338 transitions. [2023-11-19 07:35:20,178 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2023-11-19 07:35:20,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 338 transitions. [2023-11-19 07:35:20,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2023-11-19 07:35:20,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2023-11-19 07:35:20,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 338 transitions. [2023-11-19 07:35:20,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:20,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2023-11-19 07:35:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 338 transitions. [2023-11-19 07:35:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-11-19 07:35:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.396694214876033) internal successors, (338), 241 states have internal predecessors, (338), 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) [2023-11-19 07:35:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2023-11-19 07:35:20,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2023-11-19 07:35:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:20,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2023-11-19 07:35:20,211 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:35:20,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 338 transitions. [2023-11-19 07:35:20,214 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2023-11-19 07:35:20,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:20,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:20,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:35:20,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:20,215 INFO L748 eck$LassoCheckResult]: Stem: 782#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 769#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_~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_~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_~cond~0#1; 770#L85-1 [2023-11-19 07:35:20,216 INFO L750 eck$LassoCheckResult]: Loop: 770#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 810#L28 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; 805#L43 assume !(0 != main_~p1~0#1); 806#L43-2 assume !(0 != main_~p2~0#1); 848#L47-1 assume !(0 != main_~p3~0#1); 844#L51-1 assume !(0 != main_~p4~0#1); 840#L55-1 assume !(0 != main_~p5~0#1); 838#L59-1 assume !(0 != main_~p1~0#1); 835#L65-1 assume !(0 != main_~p2~0#1); 832#L70-1 assume !(0 != main_~p3~0#1); 825#L75-1 assume !(0 != main_~p4~0#1); 819#L80-1 assume !(0 != main_~p5~0#1); 770#L85-1 [2023-11-19 07:35:20,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-19 07:35:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133457245] [2023-11-19 07:35:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:20,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 29816563, now seen corresponding path program 1 times [2023-11-19 07:35:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487871955] [2023-11-19 07:35:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:20,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1243965365, now seen corresponding path program 1 times [2023-11-19 07:35:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832195137] [2023-11-19 07:35:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:20,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:35:20 BoogieIcfgContainer [2023-11-19 07:35:20,768 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-19 07:35:20,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:35:20,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:35:20,770 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:35:20,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:19" (3/4) ... [2023-11-19 07:35:20,772 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-19 07:35:20,813 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:35:20,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:35:20,814 INFO L158 Benchmark]: Toolchain (without parser) took 2262.58ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 127.5MB in the end (delta: 15.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,815 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:35:20,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.11ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 142.3MB in the end (delta: 454.6kB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.02ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 141.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,816 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 139.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:35:20,817 INFO L158 Benchmark]: RCFGBuilder took 337.05ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 128.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,818 INFO L158 Benchmark]: BuchiAutomizer took 1458.85ms. Allocated memory is still 172.0MB. Free memory was 128.8MB in the beginning and 129.5MB in the end (delta: -619.5kB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,818 INFO L158 Benchmark]: Witness Printer took 44.47ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:20,821 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.27ms. Allocated memory is still 125.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.11ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 142.3MB in the end (delta: 454.6kB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.02ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 141.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 139.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.05ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 128.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1458.85ms. Allocated memory is still 172.0MB. Free memory was 128.8MB in the beginning and 129.5MB in the end (delta: -619.5kB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 44.47ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 176 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 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: 26]: 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; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: 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; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:35:20,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ae60c8c-28ea-4f1a-8c6a-0a7b36855b7f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)