./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:15:04,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:15:04,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:15:04,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:15:04,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:15:04,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:15:04,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:15:04,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:15:04,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:15:04,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:15:04,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:15:04,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:15:04,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:15:04,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:15:04,368 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:15:04,369 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:15:04,369 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:15:04,369 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:15:04,370 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:15:04,370 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:15:04,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:15:04,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:15:04,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:15:04,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:15:04,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:15:04,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:15:04,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:15:04,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:15:04,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:15:04,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:15:04,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:15:04,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:15:04,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:15:04,376 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:15:04,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:15:04,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:15:04,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:15:04,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:15:04,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:15:04,378 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:15:04,378 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/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/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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-17 08:15:04,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:15:04,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:15:04,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:15:04,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:15:04,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:15:04,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2024-11-17 08:15:06,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:15:06,273 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:15:06,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-11-17 08:15:06,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774b6468/20a224c4b45f4820bffbe56c116d5077/FLAG71dbaffb3 [2024-11-17 08:15:06,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774b6468/20a224c4b45f4820bffbe56c116d5077 [2024-11-17 08:15:06,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:15:06,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:15:06,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:06,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:15:06,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:15:06,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20870918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06, skipping insertion in model container [2024-11-17 08:15:06,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:15:06,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:06,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:15:06,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:06,892 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:15:06,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06 WrapperNode [2024-11-17 08:15:06,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:06,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:06,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:15:06,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:15:06,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,932 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-11-17 08:15:06,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:06,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:15:06,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:15:06,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:15:06,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,959 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:15:06,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:15:06,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:15:06,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:15:06,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:15:06,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (1/1) ... [2024-11-17 08:15:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:07,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:07,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:15:07,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:15:07,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:15:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:15:07,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:15:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:15:07,149 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:15:07,151 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:15:07,325 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-17 08:15:07,325 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:15:07,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:15:07,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:15:07,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:07 BoogieIcfgContainer [2024-11-17 08:15:07,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:15:07,342 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:15:07,342 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:15:07,346 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:15:07,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:07,347 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:15:06" (1/3) ... [2024-11-17 08:15:07,348 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58bf36cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:07, skipping insertion in model container [2024-11-17 08:15:07,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:07,349 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:06" (2/3) ... [2024-11-17 08:15:07,349 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58bf36cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:07, skipping insertion in model container [2024-11-17 08:15:07,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:07,349 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:07" (3/3) ... [2024-11-17 08:15:07,351 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2024-11-17 08:15:07,406 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:15:07,406 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:15:07,406 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:15:07,407 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:15:07,407 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:15:07,407 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:15:07,407 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:15:07,407 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:15:07,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2024-11-17 08:15:07,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:07,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:07,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:07,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:07,434 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:15:07,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2024-11-17 08:15:07,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:07,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:07,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:07,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:07,445 INFO L745 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue 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); 24#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 19#L29true [2024-11-17 08:15:07,448 INFO L747 eck$LassoCheckResult]: Loop: 19#L29true assume true; 20#L29-1true assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 7#L31true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 10#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 28#L52true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4#L56true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 25#L60true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 17#L64true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 23#L68true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 5#L74true assume !(0 != main_~p1~0#1); 18#L79true assume !(0 != main_~p2~0#1); 12#L84true assume !(0 != main_~p3~0#1); 3#L89true assume !(0 != main_~p4~0#1); 13#L94true assume !(0 != main_~p5~0#1); 8#L99true assume !(0 != main_~p6~0#1); 19#L29true [2024-11-17 08:15:07,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 1 times [2024-11-17 08:15:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821519590] [2024-11-17 08:15:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 917004197, now seen corresponding path program 1 times [2024-11-17 08:15:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861880805] [2024-11-17 08:15:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:07,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:07,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861880805] [2024-11-17 08:15:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861880805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:07,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:07,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:07,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449432657] [2024-11-17 08:15:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:07,706 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:07,741 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:07,784 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2024-11-17 08:15:07,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 83 transitions. [2024-11-17 08:15:07,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2024-11-17 08:15:07,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 43 states and 65 transitions. [2024-11-17 08:15:07,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-17 08:15:07,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-17 08:15:07,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 65 transitions. [2024-11-17 08:15:07,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:07,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-11-17 08:15:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 65 transitions. [2024-11-17 08:15:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 08:15:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2024-11-17 08:15:07,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-11-17 08:15:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:07,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-11-17 08:15:07,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:15:07,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 65 transitions. [2024-11-17 08:15:07,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2024-11-17 08:15:07,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:07,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:07,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:07,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:07,841 INFO L745 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY 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); 96#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 112#L29 [2024-11-17 08:15:07,841 INFO L747 eck$LassoCheckResult]: Loop: 112#L29 assume true; 123#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 122#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 115#L48 assume !(0 != main_~p1~0#1); 116#L52 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 121#L56 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 120#L60 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 119#L64 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 118#L68 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 117#L74 assume !(0 != main_~p1~0#1); 102#L79 assume !(0 != main_~p2~0#1); 89#L84 assume !(0 != main_~p3~0#1); 91#L89 assume !(0 != main_~p4~0#1); 92#L94 assume !(0 != main_~p5~0#1); 94#L99 assume !(0 != main_~p6~0#1); 112#L29 [2024-11-17 08:15:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 2 times [2024-11-17 08:15:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740337045] [2024-11-17 08:15:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:07,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1046086916, now seen corresponding path program 1 times [2024-11-17 08:15:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357337651] [2024-11-17 08:15:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357337651] [2024-11-17 08:15:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357337651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:07,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:07,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921830176] [2024-11-17 08:15:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:07,910 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:07,911 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:07,931 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2024-11-17 08:15:07,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 122 transitions. [2024-11-17 08:15:07,934 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2024-11-17 08:15:07,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 122 transitions. [2024-11-17 08:15:07,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2024-11-17 08:15:07,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-17 08:15:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 122 transitions. [2024-11-17 08:15:07,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:07,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-11-17 08:15:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 122 transitions. [2024-11-17 08:15:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-17 08:15:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 81 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-11-17 08:15:07,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-11-17 08:15:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:07,949 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-11-17 08:15:07,949 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:15:07,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 122 transitions. [2024-11-17 08:15:07,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2024-11-17 08:15:07,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:07,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:07,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:07,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:07,955 INFO L745 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY 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); 227#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 243#L29 [2024-11-17 08:15:07,955 INFO L747 eck$LassoCheckResult]: Loop: 243#L29 assume true; 261#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 260#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 258#L48 assume !(0 != main_~p1~0#1); 257#L52 assume !(0 != main_~p2~0#1); 254#L56 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 255#L60 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L64 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 251#L68 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 272#L74 assume !(0 != main_~p1~0#1); 270#L79 assume !(0 != main_~p2~0#1); 268#L84 assume !(0 != main_~p3~0#1); 267#L89 assume !(0 != main_~p4~0#1); 265#L94 assume !(0 != main_~p5~0#1); 263#L99 assume !(0 != main_~p6~0#1); 243#L29 [2024-11-17 08:15:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 3 times [2024-11-17 08:15:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371053562] [2024-11-17 08:15:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:07,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:07,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -750864443, now seen corresponding path program 1 times [2024-11-17 08:15:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921495337] [2024-11-17 08:15:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:08,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921495337] [2024-11-17 08:15:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921495337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:08,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087082999] [2024-11-17 08:15:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:08,011 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:08,012 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:08,035 INFO L93 Difference]: Finished difference Result 158 states and 230 transitions. [2024-11-17 08:15:08,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 230 transitions. [2024-11-17 08:15:08,037 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 156 [2024-11-17 08:15:08,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 158 states and 230 transitions. [2024-11-17 08:15:08,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2024-11-17 08:15:08,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2024-11-17 08:15:08,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 230 transitions. [2024-11-17 08:15:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:08,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-17 08:15:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 230 transitions. [2024-11-17 08:15:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-17 08:15:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 157 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-17 08:15:08,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-17 08:15:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:08,063 INFO L425 stractBuchiCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-17 08:15:08,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:15:08,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 230 transitions. [2024-11-17 08:15:08,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 156 [2024-11-17 08:15:08,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:08,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:08,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:08,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:08,070 INFO L745 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY 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); 472#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 490#L29 [2024-11-17 08:15:08,070 INFO L747 eck$LassoCheckResult]: Loop: 490#L29 assume true; 509#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 507#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 504#L48 assume !(0 != main_~p1~0#1); 505#L52 assume !(0 != main_~p2~0#1); 540#L56 assume !(0 != main_~p3~0#1); 538#L60 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 536#L64 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 534#L68 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 532#L74 assume !(0 != main_~p1~0#1); 529#L79 assume !(0 != main_~p2~0#1); 525#L84 assume !(0 != main_~p3~0#1); 522#L89 assume !(0 != main_~p4~0#1); 518#L94 assume !(0 != main_~p5~0#1); 514#L99 assume !(0 != main_~p6~0#1); 490#L29 [2024-11-17 08:15:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 4 times [2024-11-17 08:15:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890687372] [2024-11-17 08:15:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -947377948, now seen corresponding path program 1 times [2024-11-17 08:15:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721049004] [2024-11-17 08:15:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721049004] [2024-11-17 08:15:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721049004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146850362] [2024-11-17 08:15:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:08,139 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:08,140 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:08,158 INFO L93 Difference]: Finished difference Result 306 states and 434 transitions. [2024-11-17 08:15:08,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 434 transitions. [2024-11-17 08:15:08,161 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 304 [2024-11-17 08:15:08,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 306 states and 434 transitions. [2024-11-17 08:15:08,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2024-11-17 08:15:08,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2024-11-17 08:15:08,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 434 transitions. [2024-11-17 08:15:08,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:08,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 306 states and 434 transitions. [2024-11-17 08:15:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 434 transitions. [2024-11-17 08:15:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-17 08:15:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 306 states have (on average 1.4183006535947713) internal successors, (434), 305 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 434 transitions. [2024-11-17 08:15:08,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 306 states and 434 transitions. [2024-11-17 08:15:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:08,201 INFO L425 stractBuchiCegarLoop]: Abstraction has 306 states and 434 transitions. [2024-11-17 08:15:08,202 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:15:08,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 434 transitions. [2024-11-17 08:15:08,204 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 304 [2024-11-17 08:15:08,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:08,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:08,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:08,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:08,205 INFO L745 eck$LassoCheckResult]: Stem: 941#ULTIMATE.startENTRY 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); 942#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 963#L29 [2024-11-17 08:15:08,206 INFO L747 eck$LassoCheckResult]: Loop: 963#L29 assume true; 989#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 983#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 984#L48 assume !(0 != main_~p1~0#1); 1051#L52 assume !(0 != main_~p2~0#1); 1044#L56 assume !(0 != main_~p3~0#1); 1039#L60 assume !(0 != main_~p4~0#1); 1035#L64 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1031#L68 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1028#L74 assume !(0 != main_~p1~0#1); 1024#L79 assume !(0 != main_~p2~0#1); 1020#L84 assume !(0 != main_~p3~0#1); 1018#L89 assume !(0 != main_~p4~0#1); 999#L94 assume !(0 != main_~p5~0#1); 998#L99 assume !(0 != main_~p6~0#1); 963#L29 [2024-11-17 08:15:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 5 times [2024-11-17 08:15:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689952583] [2024-11-17 08:15:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1540134885, now seen corresponding path program 1 times [2024-11-17 08:15:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546625032] [2024-11-17 08:15:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546625032] [2024-11-17 08:15:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546625032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:08,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:08,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653954133] [2024-11-17 08:15:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:08,261 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:08,263 INFO L87 Difference]: Start difference. First operand 306 states and 434 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:08,291 INFO L93 Difference]: Finished difference Result 594 states and 818 transitions. [2024-11-17 08:15:08,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 818 transitions. [2024-11-17 08:15:08,296 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 592 [2024-11-17 08:15:08,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 594 states and 818 transitions. [2024-11-17 08:15:08,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2024-11-17 08:15:08,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2024-11-17 08:15:08,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 818 transitions. [2024-11-17 08:15:08,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:08,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 594 states and 818 transitions. [2024-11-17 08:15:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 818 transitions. [2024-11-17 08:15:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2024-11-17 08:15:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 594 states have (on average 1.3771043771043772) internal successors, (818), 593 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 818 transitions. [2024-11-17 08:15:08,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 594 states and 818 transitions. [2024-11-17 08:15:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:08,344 INFO L425 stractBuchiCegarLoop]: Abstraction has 594 states and 818 transitions. [2024-11-17 08:15:08,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:15:08,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 594 states and 818 transitions. [2024-11-17 08:15:08,350 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 592 [2024-11-17 08:15:08,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:08,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:08,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:08,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:08,352 INFO L745 eck$LassoCheckResult]: Stem: 1846#ULTIMATE.startENTRY 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); 1847#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 1868#L29 [2024-11-17 08:15:08,352 INFO L747 eck$LassoCheckResult]: Loop: 1868#L29 assume true; 1964#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1948#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 1949#L48 assume !(0 != main_~p1~0#1); 1932#L52 assume !(0 != main_~p2~0#1); 1934#L56 assume !(0 != main_~p3~0#1); 1908#L60 assume !(0 != main_~p4~0#1); 1910#L64 assume !(0 != main_~p5~0#1); 2000#L68 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1997#L74 assume !(0 != main_~p1~0#1); 1998#L79 assume !(0 != main_~p2~0#1); 2012#L84 assume !(0 != main_~p3~0#1); 2010#L89 assume !(0 != main_~p4~0#1); 2008#L94 assume !(0 != main_~p5~0#1); 2006#L99 assume !(0 != main_~p6~0#1); 1868#L29 [2024-11-17 08:15:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 6 times [2024-11-17 08:15:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227641179] [2024-11-17 08:15:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1012022076, now seen corresponding path program 1 times [2024-11-17 08:15:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132842877] [2024-11-17 08:15:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:08,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132842877] [2024-11-17 08:15:08,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132842877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:15:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819486437] [2024-11-17 08:15:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:08,393 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:08,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:08,394 INFO L87 Difference]: Start difference. First operand 594 states and 818 transitions. cyclomatic complexity: 256 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:08,437 INFO L93 Difference]: Finished difference Result 1154 states and 1538 transitions. [2024-11-17 08:15:08,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1538 transitions. [2024-11-17 08:15:08,451 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1152 [2024-11-17 08:15:08,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1538 transitions. [2024-11-17 08:15:08,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2024-11-17 08:15:08,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2024-11-17 08:15:08,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1538 transitions. [2024-11-17 08:15:08,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:08,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2024-11-17 08:15:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1538 transitions. [2024-11-17 08:15:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2024-11-17 08:15:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1154 states have (on average 1.3327556325823224) internal successors, (1538), 1153 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:15:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1538 transitions. [2024-11-17 08:15:08,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2024-11-17 08:15:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:08,486 INFO L425 stractBuchiCegarLoop]: Abstraction has 1154 states and 1538 transitions. [2024-11-17 08:15:08,486 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:15:08,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1154 states and 1538 transitions. [2024-11-17 08:15:08,492 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1152 [2024-11-17 08:15:08,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:08,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:08,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:08,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:08,493 INFO L745 eck$LassoCheckResult]: Stem: 3600#ULTIMATE.startENTRY 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); 3601#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_~cond~0#1; 3623#L29 [2024-11-17 08:15:08,493 INFO L747 eck$LassoCheckResult]: Loop: 3623#L29 assume true; 3698#L29-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 3694#L31 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0; 3690#L48 assume !(0 != main_~p1~0#1); 3683#L52 assume !(0 != main_~p2~0#1); 3675#L56 assume !(0 != main_~p3~0#1); 3667#L60 assume !(0 != main_~p4~0#1); 3659#L64 assume !(0 != main_~p5~0#1); 3652#L68 assume !(0 != main_~p6~0#1); 3653#L74 assume !(0 != main_~p1~0#1); 3732#L79 assume !(0 != main_~p2~0#1); 3724#L84 assume !(0 != main_~p3~0#1); 3716#L89 assume !(0 != main_~p4~0#1); 3709#L94 assume !(0 != main_~p5~0#1); 3705#L99 assume !(0 != main_~p6~0#1); 3623#L29 [2024-11-17 08:15:08,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash 3264, now seen corresponding path program 7 times [2024-11-17 08:15:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140246653] [2024-11-17 08:15:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash -124518395, now seen corresponding path program 1 times [2024-11-17 08:15:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295187699] [2024-11-17 08:15:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 449772902, now seen corresponding path program 1 times [2024-11-17 08:15:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:08,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226574853] [2024-11-17 08:15:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:08,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:15:08 BoogieIcfgContainer [2024-11-17 08:15:08,885 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:15:08,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:15:08,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:15:08,886 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:15:08,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:07" (3/4) ... [2024-11-17 08:15:08,889 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:15:08,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:15:08,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:15:08,932 INFO L158 Benchmark]: Toolchain (without parser) took 2286.93ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 80.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,932 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:08,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.18ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 73.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 155.2MB. Free memory was 73.3MB in the beginning and 128.3MB in the end (delta: -55.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,933 INFO L158 Benchmark]: Boogie Preprocessor took 32.10ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 125.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,933 INFO L158 Benchmark]: IcfgBuilder took 374.88ms. Allocated memory is still 155.2MB. Free memory was 125.5MB in the beginning and 113.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,934 INFO L158 Benchmark]: BuchiAutomizer took 1543.25ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 82.5MB in the end (delta: 30.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,934 INFO L158 Benchmark]: Witness Printer took 45.49ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:08,936 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.16ms. Allocated memory is still 113.2MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.18ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 73.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 155.2MB. Free memory was 73.3MB in the beginning and 128.3MB in the end (delta: -55.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.10ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 125.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 374.88ms. Allocated memory is still 155.2MB. Free memory was 125.5MB in the beginning and 113.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1543.25ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 82.5MB in the end (delta: 30.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 45.49ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 80.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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1154 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 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, 158 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 497 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 315 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:15:08,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)