./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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.5-dev-84cfde4 [2024-10-12 00:26:25,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:26:25,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:26:25,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:26:25,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:26:25,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:26:25,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:26:25,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:26:25,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:26:25,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:26:25,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:26:25,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:26:25,431 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:26:25,433 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:26:25,433 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:26:25,434 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:26:25,434 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:26:25,434 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:26:25,434 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:26:25,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:26:25,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:26:25,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:26:25,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:26:25,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:26:25,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:26:25,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:26:25,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:26:25,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:26:25,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:26:25,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:26:25,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:26:25,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:26:25,438 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:26:25,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:26:25,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:26:25,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:26:25,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:26:25,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:26:25,440 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:26:25,440 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 [2024-10-12 00:26:25,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:26:25,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:26:25,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:26:25,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:26:25,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:26:25,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2024-10-12 00:26:27,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:26:27,239 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:26:27,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2024-10-12 00:26:27,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78fd0ca09/6f352444802445fcac43e48f257a63e2/FLAG07cdf87a0 [2024-10-12 00:26:27,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78fd0ca09/6f352444802445fcac43e48f257a63e2 [2024-10-12 00:26:27,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:26:27,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:26:27,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:27,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:26:27,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:26:27,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec1bd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27, skipping insertion in model container [2024-10-12 00:26:27,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:26:27,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:27,453 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:26:27,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:27,480 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:26:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27 WrapperNode [2024-10-12 00:26:27,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:27,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:27,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:26:27,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:26:27,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,507 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-10-12 00:26:27,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:27,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:26:27,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:26:27,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:26:27,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,559 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-10-12 00:26:27,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:26:27,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:26:27,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:26:27,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:26:27,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (1/1) ... [2024-10-12 00:26:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:27,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:27,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:27,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:26:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:26:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:26:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:26:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:26:27,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:26:27,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:26:27,776 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 00:26:27,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:26:27,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:26:27,787 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:26:27,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:27 BoogieIcfgContainer [2024-10-12 00:26:27,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:26:27,788 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:26:27,788 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:26:27,791 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:26:27,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:27,792 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:26:27" (1/3) ... [2024-10-12 00:26:27,793 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ac84c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:27, skipping insertion in model container [2024-10-12 00:26:27,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:27,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:27" (2/3) ... [2024-10-12 00:26:27,793 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ac84c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:27, skipping insertion in model container [2024-10-12 00:26:27,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:27,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:27" (3/3) ... [2024-10-12 00:26:27,795 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2024-10-12 00:26:27,847 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:26:27,847 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:26:27,848 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:26:27,848 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:26:27,848 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:26:27,848 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:26:27,849 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:26:27,849 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:26:27,856 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) [2024-10-12 00:26:27,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-12 00:26:27,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:27,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:27,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:27,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:27,884 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:26:27,885 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) [2024-10-12 00:26:27,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-12 00:26:27,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:27,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:27,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:27,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:27,895 INFO L745 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#0(48, 1, 0, 1);call write~init~int#0(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 [2024-10-12 00:26:27,896 INFO L747 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 [2024-10-12 00:26:27,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:26:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:27,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498897834] [2024-10-12 00:26:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:27,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2089480461, now seen corresponding path program 1 times [2024-10-12 00:26:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738669956] [2024-10-12 00:26:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738669956] [2024-10-12 00:26:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738669956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495468103] [2024-10-12 00:26:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:28,104 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:28,133 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) [2024-10-12 00:26:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:28,156 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2024-10-12 00:26:28,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2024-10-12 00:26:28,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-10-12 00:26:28,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 35 states and 53 transitions. [2024-10-12 00:26:28,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-10-12 00:26:28,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-12 00:26:28,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2024-10-12 00:26:28,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:28,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-10-12 00:26:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2024-10-12 00:26:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 00:26:28,184 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) [2024-10-12 00:26:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2024-10-12 00:26:28,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-10-12 00:26:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:28,190 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-10-12 00:26:28,190 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:26:28,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2024-10-12 00:26:28,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-10-12 00:26:28,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:28,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:28,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:28,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:28,192 INFO L745 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#0(48, 1, 0, 1);call write~init~int#0(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 [2024-10-12 00:26:28,192 INFO L747 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 [2024-10-12 00:26:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:26:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316829827] [2024-10-12 00:26:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1812459825, now seen corresponding path program 1 times [2024-10-12 00:26:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926447067] [2024-10-12 00:26:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926447067] [2024-10-12 00:26:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926447067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561855593] [2024-10-12 00:26:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:28,279 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:28,280 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) [2024-10-12 00:26:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:28,325 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2024-10-12 00:26:28,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2024-10-12 00:26:28,330 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-10-12 00:26:28,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 98 transitions. [2024-10-12 00:26:28,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-10-12 00:26:28,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-10-12 00:26:28,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2024-10-12 00:26:28,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:28,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-12 00:26:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2024-10-12 00:26:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-12 00:26:28,336 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) [2024-10-12 00:26:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-12 00:26:28,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-12 00:26:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:28,338 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-12 00:26:28,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:26:28,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 98 transitions. [2024-10-12 00:26:28,339 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-10-12 00:26:28,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:28,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:28,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:28,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:28,340 INFO L745 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#0(48, 1, 0, 1);call write~init~int#0(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 [2024-10-12 00:26:28,340 INFO L747 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 [2024-10-12 00:26:28,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:26:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847522059] [2024-10-12 00:26:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1802449101, now seen corresponding path program 1 times [2024-10-12 00:26:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916540705] [2024-10-12 00:26:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:28,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:28,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916540705] [2024-10-12 00:26:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916540705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:28,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680699786] [2024-10-12 00:26:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:28,384 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:28,384 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) [2024-10-12 00:26:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:28,397 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2024-10-12 00:26:28,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 182 transitions. [2024-10-12 00:26:28,399 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2024-10-12 00:26:28,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 182 transitions. [2024-10-12 00:26:28,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-10-12 00:26:28,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-12 00:26:28,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 182 transitions. [2024-10-12 00:26:28,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:28,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-12 00:26:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 182 transitions. [2024-10-12 00:26:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 00:26:28,408 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) [2024-10-12 00:26:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-10-12 00:26:28,409 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-12 00:26:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:28,410 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-12 00:26:28,410 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:26:28,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 182 transitions. [2024-10-12 00:26:28,412 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2024-10-12 00:26:28,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:28,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:28,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:28,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:28,413 INFO L745 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#0(48, 1, 0, 1);call write~init~int#0(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 [2024-10-12 00:26:28,413 INFO L747 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 [2024-10-12 00:26:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:26:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607646184] [2024-10-12 00:26:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -27441739, now seen corresponding path program 1 times [2024-10-12 00:26:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673702928] [2024-10-12 00:26:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673702928] [2024-10-12 00:26:28,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673702928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:28,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:28,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:26:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957139488] [2024-10-12 00:26:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:28,444 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:28,445 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) [2024-10-12 00:26:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:28,458 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2024-10-12 00:26:28,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 338 transitions. [2024-10-12 00:26:28,461 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2024-10-12 00:26:28,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 338 transitions. [2024-10-12 00:26:28,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2024-10-12 00:26:28,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2024-10-12 00:26:28,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 338 transitions. [2024-10-12 00:26:28,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:28,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-10-12 00:26:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 338 transitions. [2024-10-12 00:26:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-10-12 00:26:28,474 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) [2024-10-12 00:26:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2024-10-12 00:26:28,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-10-12 00:26:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:28,477 INFO L425 stractBuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-10-12 00:26:28,477 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:26:28,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 338 transitions. [2024-10-12 00:26:28,479 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2024-10-12 00:26:28,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:28,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:28,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:28,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:28,480 INFO L745 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#0(48, 1, 0, 1);call write~init~int#0(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 [2024-10-12 00:26:28,480 INFO L747 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 [2024-10-12 00:26:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:26:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345520964] [2024-10-12 00:26:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 29816563, now seen corresponding path program 1 times [2024-10-12 00:26:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491023111] [2024-10-12 00:26:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1243965365, now seen corresponding path program 1 times [2024-10-12 00:26:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054300681] [2024-10-12 00:26:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:26:28 BoogieIcfgContainer [2024-10-12 00:26:28,794 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:26:28,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:26:28,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:26:28,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:26:28,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:27" (3/4) ... [2024-10-12 00:26:28,796 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:26:28,836 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:26:28,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:26:28,837 INFO L158 Benchmark]: Toolchain (without parser) took 1562.95ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 91.6MB in the end (delta: 6.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:28,837 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 123.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:28,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.17ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:26:28,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.00ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:28,838 INFO L158 Benchmark]: Boogie Preprocessor took 59.72ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 136.9MB in the end (delta: -53.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 00:26:28,838 INFO L158 Benchmark]: RCFGBuilder took 219.28ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 125.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:26:28,838 INFO L158 Benchmark]: BuchiAutomizer took 1005.51ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 93.7MB in the end (delta: 31.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-10-12 00:26:28,839 INFO L158 Benchmark]: Witness Printer took 42.24ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:28,845 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.14ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 123.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.17ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 85.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.00ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.72ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 136.9MB in the end (delta: -53.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 219.28ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 125.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1005.51ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 93.7MB in the end (delta: 31.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Witness Printer took 42.24ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. 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 0.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s 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.0s 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! [2024-10-12 00:26:28,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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)