./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f 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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:45:46,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:45:46,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:45:46,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:45:46,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:45:46,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:45:46,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:45:46,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:45:46,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:45:46,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:45:46,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:45:46,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:45:46,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:45:46,255 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:45:46,255 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:45:46,256 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:45:46,256 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:45:46,256 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:45:46,256 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:45:46,257 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:45:46,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:45:46,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:45:46,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:45:46,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:45:46,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:45:46,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:45:46,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:45:46,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:45:46,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:45:46,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:45:46,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:45:46,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:45:46,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:45:46,261 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:45:46,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:45:46,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:45:46,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:45:46,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:45:46,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:45:46,262 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:45:46,263 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-10 22:45:46,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:45:46,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:45:46,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:45:46,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:45:46,526 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:45:46,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2024-11-10 22:45:47,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:45:48,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:45:48,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2024-11-10 22:45:48,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788f162c1/8a6ced73870e49c8b46ae9a73ff352e2/FLAGaa69453ab [2024-11-10 22:45:48,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788f162c1/8a6ced73870e49c8b46ae9a73ff352e2 [2024-11-10 22:45:48,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:45:48,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:45:48,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:48,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:45:48,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:45:48,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17857042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48, skipping insertion in model container [2024-11-10 22:45:48,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:45:48,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:48,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:45:48,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:48,311 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:45:48,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48 WrapperNode [2024-11-10 22:45:48,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:48,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:48,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:45:48,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:45:48,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,338 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2024-11-10 22:45:48,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:48,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:45:48,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:45:48,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:45:48,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,372 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-10 22:45:48,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:45:48,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:45:48,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:45:48,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:45:48,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (1/1) ... [2024-11-10 22:45:48,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:48,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:48,431 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-10 22:45:48,434 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-10 22:45:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:45:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:45:48,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:45:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:45:48,528 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:45:48,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:45:48,716 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 22:45:48,716 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:45:48,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:45:48,725 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:45:48,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:48 BoogieIcfgContainer [2024-11-10 22:45:48,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:45:48,726 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:45:48,726 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:45:48,729 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:45:48,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:48,730 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:45:48" (1/3) ... [2024-11-10 22:45:48,730 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@233a6788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:48, skipping insertion in model container [2024-11-10 22:45:48,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:48,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:48" (2/3) ... [2024-11-10 22:45:48,731 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@233a6788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:48, skipping insertion in model container [2024-11-10 22:45:48,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:48,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:48" (3/3) ... [2024-11-10 22:45:48,732 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2024-11-10 22:45:48,768 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:45:48,769 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:45:48,769 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:45:48,769 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:45:48,769 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:45:48,769 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:45:48,769 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:45:48,769 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:45:48,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-10 22:45:48,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-11-10 22:45:48,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:48,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:48,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:48,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:48,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:45:48,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-10 22:45:48,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-11-10 22:45:48,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:48,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:48,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:48,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:48,795 INFO L745 eck$LassoCheckResult]: Stem: 17#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); 26#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 21#L32true [2024-11-10 22:45:48,796 INFO L747 eck$LassoCheckResult]: Loop: 21#L32true assume true; 6#L32-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 31#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 30#L57true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 5#L61true assume !(0 != main_~p3~0#1); 33#L65true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 12#L69true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 28#L73true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 7#L77true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L83true assume !(0 != main_~p1~0#1); 25#L88true assume !(0 != main_~p2~0#1); 3#L93true assume !(0 != main_~p3~0#1); 4#L98true assume !(0 != main_~p4~0#1); 16#L103true assume !(0 != main_~p5~0#1); 20#L108true assume !(0 != main_~p6~0#1); 9#L113true assume !(0 != main_~p7~0#1); 21#L32true [2024-11-10 22:45:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 1 times [2024-11-10 22:45:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136929137] [2024-11-10 22:45:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:48,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:48,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:48,895 INFO L85 PathProgramCache]: Analyzing trace with hash 9350316, now seen corresponding path program 1 times [2024-11-10 22:45:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131072061] [2024-11-10 22:45:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:48,992 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-10 22:45:48,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:48,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131072061] [2024-11-10 22:45:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131072061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322129616] [2024-11-10 22:45:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:48,998 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,034 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,069 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2024-11-10 22:45:49,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 95 transitions. [2024-11-10 22:45:49,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2024-11-10 22:45:49,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 49 states and 75 transitions. [2024-11-10 22:45:49,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-10 22:45:49,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-10 22:45:49,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 75 transitions. [2024-11-10 22:45:49,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-11-10 22:45:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 75 transitions. [2024-11-10 22:45:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 22:45:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 48 states have internal predecessors, (75), 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-10 22:45:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-11-10 22:45:49,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-11-10 22:45:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,117 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-11-10 22:45:49,117 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:45:49,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 75 transitions. [2024-11-10 22:45:49,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2024-11-10 22:45:49,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,119 INFO L745 eck$LassoCheckResult]: Stem: 117#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); 118#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 111#L32 [2024-11-10 22:45:49,119 INFO L747 eck$LassoCheckResult]: Loop: 111#L32 assume true; 105#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 106#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 123#L53 assume !(0 != main_~p1~0#1); 126#L57 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 146#L61 assume !(0 != main_~p3~0#1); 145#L65 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 144#L69 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 143#L73 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 142#L77 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 141#L83 assume !(0 != main_~p1~0#1); 122#L88 assume !(0 != main_~p2~0#1); 98#L93 assume !(0 != main_~p3~0#1); 100#L98 assume !(0 != main_~p4~0#1); 102#L103 assume !(0 != main_~p5~0#1); 116#L108 assume !(0 != main_~p6~0#1); 109#L113 assume !(0 != main_~p7~0#1); 111#L32 [2024-11-10 22:45:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 2 times [2024-11-10 22:45:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826961986] [2024-11-10 22:45:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -496208309, now seen corresponding path program 1 times [2024-11-10 22:45:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467835206] [2024-11-10 22:45:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:49,162 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-10 22:45:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:49,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467835206] [2024-11-10 22:45:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467835206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:49,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256019886] [2024-11-10 22:45:49,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:49,164 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,165 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,178 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2024-11-10 22:45:49,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 142 transitions. [2024-11-10 22:45:49,179 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2024-11-10 22:45:49,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 142 transitions. [2024-11-10 22:45:49,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-10 22:45:49,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-10 22:45:49,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 142 transitions. [2024-11-10 22:45:49,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-11-10 22:45:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 142 transitions. [2024-11-10 22:45:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 22:45:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 93 states have internal predecessors, (142), 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-10 22:45:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2024-11-10 22:45:49,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-11-10 22:45:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,190 INFO L425 stractBuchiCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-11-10 22:45:49,190 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:45:49,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 142 transitions. [2024-11-10 22:45:49,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2024-11-10 22:45:49,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,192 INFO L745 eck$LassoCheckResult]: Stem: 267#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); 268#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 273#L32 [2024-11-10 22:45:49,192 INFO L747 eck$LassoCheckResult]: Loop: 273#L32 assume true; 317#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 304#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 303#L53 assume !(0 != main_~p1~0#1); 302#L57 assume !(0 != main_~p2~0#1); 291#L61 assume !(0 != main_~p3~0#1); 292#L65 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 296#L69 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 295#L73 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 283#L77 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 284#L83 assume !(0 != main_~p1~0#1); 293#L88 assume !(0 != main_~p2~0#1); 329#L93 assume !(0 != main_~p3~0#1); 326#L98 assume !(0 != main_~p4~0#1); 325#L103 assume !(0 != main_~p5~0#1); 323#L108 assume !(0 != main_~p6~0#1); 321#L113 assume !(0 != main_~p7~0#1); 273#L32 [2024-11-10 22:45:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 3 times [2024-11-10 22:45:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101263598] [2024-11-10 22:45:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -789611316, now seen corresponding path program 1 times [2024-11-10 22:45:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973156484] [2024-11-10 22:45:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:49,227 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-10 22:45:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973156484] [2024-11-10 22:45:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973156484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:49,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:49,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002927350] [2024-11-10 22:45:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:49,229 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,230 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,243 INFO L93 Difference]: Finished difference Result 182 states and 270 transitions. [2024-11-10 22:45:49,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 270 transitions. [2024-11-10 22:45:49,249 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2024-11-10 22:45:49,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 270 transitions. [2024-11-10 22:45:49,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2024-11-10 22:45:49,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2024-11-10 22:45:49,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 270 transitions. [2024-11-10 22:45:49,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 270 transitions. [2024-11-10 22:45:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 270 transitions. [2024-11-10 22:45:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-10 22:45:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 181 states have internal predecessors, (270), 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-10 22:45:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 270 transitions. [2024-11-10 22:45:49,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 270 transitions. [2024-11-10 22:45:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,278 INFO L425 stractBuchiCegarLoop]: Abstraction has 182 states and 270 transitions. [2024-11-10 22:45:49,278 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:45:49,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 270 transitions. [2024-11-10 22:45:49,280 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2024-11-10 22:45:49,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,282 INFO L745 eck$LassoCheckResult]: Stem: 549#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); 550#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 555#L32 [2024-11-10 22:45:49,282 INFO L747 eck$LassoCheckResult]: Loop: 555#L32 assume true; 579#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 577#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 575#L53 assume !(0 != main_~p1~0#1); 572#L57 assume !(0 != main_~p2~0#1); 568#L61 assume !(0 != main_~p3~0#1); 569#L65 assume !(0 != main_~p4~0#1); 610#L69 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 608#L73 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 606#L77 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 602#L83 assume !(0 != main_~p1~0#1); 600#L88 assume !(0 != main_~p2~0#1); 598#L93 assume !(0 != main_~p3~0#1); 594#L98 assume !(0 != main_~p4~0#1); 592#L103 assume !(0 != main_~p5~0#1); 588#L108 assume !(0 != main_~p6~0#1); 584#L113 assume !(0 != main_~p7~0#1); 555#L32 [2024-11-10 22:45:49,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 4 times [2024-11-10 22:45:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854483255] [2024-11-10 22:45:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1708404621, now seen corresponding path program 1 times [2024-11-10 22:45:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135014546] [2024-11-10 22:45:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:49,331 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-10 22:45:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135014546] [2024-11-10 22:45:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135014546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049958492] [2024-11-10 22:45:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:49,335 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,338 INFO L87 Difference]: Start difference. First operand 182 states and 270 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,362 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2024-11-10 22:45:49,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 514 transitions. [2024-11-10 22:45:49,364 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 352 [2024-11-10 22:45:49,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 354 states and 514 transitions. [2024-11-10 22:45:49,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2024-11-10 22:45:49,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2024-11-10 22:45:49,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 514 transitions. [2024-11-10 22:45:49,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 354 states and 514 transitions. [2024-11-10 22:45:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 514 transitions. [2024-11-10 22:45:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-10 22:45:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 1.4519774011299436) internal successors, (514), 353 states have internal predecessors, (514), 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-10 22:45:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 514 transitions. [2024-11-10 22:45:49,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 514 transitions. [2024-11-10 22:45:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,383 INFO L425 stractBuchiCegarLoop]: Abstraction has 354 states and 514 transitions. [2024-11-10 22:45:49,383 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:45:49,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 514 transitions. [2024-11-10 22:45:49,384 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 352 [2024-11-10 22:45:49,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,385 INFO L745 eck$LassoCheckResult]: Stem: 1091#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); 1092#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 1100#L32 [2024-11-10 22:45:49,385 INFO L747 eck$LassoCheckResult]: Loop: 1100#L32 assume true; 1155#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1139#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 1140#L53 assume !(0 != main_~p1~0#1); 1202#L57 assume !(0 != main_~p2~0#1); 1201#L61 assume !(0 != main_~p3~0#1); 1199#L65 assume !(0 != main_~p4~0#1); 1196#L69 assume !(0 != main_~p5~0#1); 1194#L73 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1192#L77 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1190#L83 assume !(0 != main_~p1~0#1); 1182#L88 assume !(0 != main_~p2~0#1); 1184#L93 assume !(0 != main_~p3~0#1); 1174#L98 assume !(0 != main_~p4~0#1); 1176#L103 assume !(0 != main_~p5~0#1); 1170#L108 assume !(0 != main_~p6~0#1); 1169#L113 assume !(0 != main_~p7~0#1); 1100#L32 [2024-11-10 22:45:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 5 times [2024-11-10 22:45:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841216686] [2024-11-10 22:45:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1511891116, now seen corresponding path program 1 times [2024-11-10 22:45:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770529756] [2024-11-10 22:45:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:49,415 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-10 22:45:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770529756] [2024-11-10 22:45:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770529756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062465420] [2024-11-10 22:45:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:49,417 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,418 INFO L87 Difference]: Start difference. First operand 354 states and 514 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,430 INFO L93 Difference]: Finished difference Result 690 states and 978 transitions. [2024-11-10 22:45:49,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 978 transitions. [2024-11-10 22:45:49,437 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 688 [2024-11-10 22:45:49,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 690 states and 978 transitions. [2024-11-10 22:45:49,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2024-11-10 22:45:49,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2024-11-10 22:45:49,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 690 states and 978 transitions. [2024-11-10 22:45:49,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 690 states and 978 transitions. [2024-11-10 22:45:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states and 978 transitions. [2024-11-10 22:45:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-10 22:45:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 690 states have (on average 1.4173913043478261) internal successors, (978), 689 states have internal predecessors, (978), 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-10 22:45:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 978 transitions. [2024-11-10 22:45:49,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 690 states and 978 transitions. [2024-11-10 22:45:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,475 INFO L425 stractBuchiCegarLoop]: Abstraction has 690 states and 978 transitions. [2024-11-10 22:45:49,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:49,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 978 transitions. [2024-11-10 22:45:49,477 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 688 [2024-11-10 22:45:49,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,478 INFO L745 eck$LassoCheckResult]: Stem: 2140#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); 2141#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 2150#L32 [2024-11-10 22:45:49,478 INFO L747 eck$LassoCheckResult]: Loop: 2150#L32 assume true; 2193#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2191#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 2188#L53 assume !(0 != main_~p1~0#1); 2189#L57 assume !(0 != main_~p2~0#1); 2235#L61 assume !(0 != main_~p3~0#1); 2232#L65 assume !(0 != main_~p4~0#1); 2228#L69 assume !(0 != main_~p5~0#1); 2224#L73 assume !(0 != main_~p6~0#1); 2222#L77 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2220#L83 assume !(0 != main_~p1~0#1); 2217#L88 assume !(0 != main_~p2~0#1); 2214#L93 assume !(0 != main_~p3~0#1); 2209#L98 assume !(0 != main_~p4~0#1); 2205#L103 assume !(0 != main_~p5~0#1); 2201#L108 assume !(0 != main_~p6~0#1); 2198#L113 assume !(0 != main_~p7~0#1); 2150#L32 [2024-11-10 22:45:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 6 times [2024-11-10 22:45:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215171429] [2024-11-10 22:45:49,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash -295563347, now seen corresponding path program 1 times [2024-11-10 22:45:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054703002] [2024-11-10 22:45:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:49,521 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-10 22:45:49,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054703002] [2024-11-10 22:45:49,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054703002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:49,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:45:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197763256] [2024-11-10 22:45:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:49,524 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:49,525 INFO L87 Difference]: Start difference. First operand 690 states and 978 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-10 22:45:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:49,543 INFO L93 Difference]: Finished difference Result 1346 states and 1858 transitions. [2024-11-10 22:45:49,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1346 states and 1858 transitions. [2024-11-10 22:45:49,550 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1344 [2024-11-10 22:45:49,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1346 states to 1346 states and 1858 transitions. [2024-11-10 22:45:49,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1346 [2024-11-10 22:45:49,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1346 [2024-11-10 22:45:49,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1346 states and 1858 transitions. [2024-11-10 22:45:49,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:49,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2024-11-10 22:45:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states and 1858 transitions. [2024-11-10 22:45:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2024-11-10 22:45:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1346 states have (on average 1.3803863298662704) internal successors, (1858), 1345 states have internal predecessors, (1858), 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-10 22:45:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1858 transitions. [2024-11-10 22:45:49,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2024-11-10 22:45:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:49,585 INFO L425 stractBuchiCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2024-11-10 22:45:49,585 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:49,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 1858 transitions. [2024-11-10 22:45:49,589 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1344 [2024-11-10 22:45:49,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:49,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:49,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:49,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:49,590 INFO L745 eck$LassoCheckResult]: Stem: 4183#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); 4184#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_#t~nondet11#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_~cond~0#1; 4193#L32 [2024-11-10 22:45:49,591 INFO L747 eck$LassoCheckResult]: Loop: 4193#L32 assume true; 4365#L32-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4362#L34 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0; 4359#L53 assume !(0 != main_~p1~0#1); 4357#L57 assume !(0 != main_~p2~0#1); 4354#L61 assume !(0 != main_~p3~0#1); 4350#L65 assume !(0 != main_~p4~0#1); 4346#L69 assume !(0 != main_~p5~0#1); 4343#L73 assume !(0 != main_~p6~0#1); 4333#L77 assume !(0 != main_~p7~0#1); 4324#L83 assume !(0 != main_~p1~0#1); 4319#L88 assume !(0 != main_~p2~0#1); 4317#L93 assume !(0 != main_~p3~0#1); 4312#L98 assume !(0 != main_~p4~0#1); 4306#L103 assume !(0 != main_~p5~0#1); 4308#L108 assume !(0 != main_~p6~0#1); 4368#L113 assume !(0 != main_~p7~0#1); 4193#L32 [2024-11-10 22:45:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 3552, now seen corresponding path program 7 times [2024-11-10 22:45:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514886495] [2024-11-10 22:45:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1447246988, now seen corresponding path program 1 times [2024-11-10 22:45:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916745168] [2024-11-10 22:45:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash -103626611, now seen corresponding path program 1 times [2024-11-10 22:45:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054361829] [2024-11-10 22:45:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:49,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:49 BoogieIcfgContainer [2024-11-10 22:45:49,916 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:49,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:49,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:49,917 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:49,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:48" (3/4) ... [2024-11-10 22:45:49,921 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:45:49,954 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:45:49,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:49,955 INFO L158 Benchmark]: Toolchain (without parser) took 1876.48ms. Allocated memory is still 190.8MB. Free memory was 119.4MB in the beginning and 131.4MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:49,955 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:49,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.40ms. Allocated memory is still 190.8MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:49,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.60ms. Allocated memory is still 190.8MB. Free memory was 106.5MB in the beginning and 104.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:49,956 INFO L158 Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 190.8MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:49,957 INFO L158 Benchmark]: IcfgBuilder took 344.09ms. Allocated memory is still 190.8MB. Free memory was 103.3MB in the beginning and 155.5MB in the end (delta: -52.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:49,957 INFO L158 Benchmark]: BuchiAutomizer took 1189.83ms. Allocated memory is still 190.8MB. Free memory was 155.5MB in the beginning and 133.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-11-10 22:45:49,957 INFO L158 Benchmark]: Witness Printer took 38.50ms. Allocated memory is still 190.8MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:49,958 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.15ms. Allocated memory is still 190.8MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.40ms. Allocated memory is still 190.8MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.60ms. Allocated memory is still 190.8MB. Free memory was 106.5MB in the beginning and 104.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.73ms. Allocated memory is still 190.8MB. Free memory was 104.9MB in the beginning and 103.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.09ms. Allocated memory is still 190.8MB. Free memory was 103.3MB in the beginning and 155.5MB in the end (delta: -52.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 1189.83ms. Allocated memory is still 190.8MB. Free memory was 155.5MB in the beginning and 133.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 38.50ms. Allocated memory is still 190.8MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). 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 1346 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. 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, 183 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 361 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: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:45:49,986 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)