./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:22:59,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:22:59,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:22:59,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:22:59,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:22:59,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:22:59,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:22:59,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:22:59,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:22:59,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:22:59,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:22:59,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:22:59,853 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:22:59,853 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:22:59,853 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:22:59,854 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:22:59,855 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:22:59,855 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:22:59,855 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:22:59,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:22:59,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:22:59,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:22:59,860 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:22:59,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:22:59,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:22:59,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:22:59,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:22:59,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:22:59,862 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:22:59,862 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-10-15 00:23:00,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:23:00,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:23:00,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:23:00,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:23:00,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:23:00,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-10-15 00:23:01,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:23:01,570 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:23:01,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-10-15 00:23:01,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb85c829c/04648715188d4ad888d8b3f0c2d097f3/FLAG42ac60e78 [2024-10-15 00:23:01,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb85c829c/04648715188d4ad888d8b3f0c2d097f3 [2024-10-15 00:23:01,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:23:01,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:23:01,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:23:01,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:23:01,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:23:01,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:23:01" (1/1) ... [2024-10-15 00:23:01,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f2953b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:01, skipping insertion in model container [2024-10-15 00:23:01,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:23:01" (1/1) ... [2024-10-15 00:23:01,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:23:02,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:23:02,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:23:02,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:23:02,177 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:23:02,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02 WrapperNode [2024-10-15 00:23:02,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:23:02,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:23:02,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:23:02,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:23:02,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,206 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2024-10-15 00:23:02,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:23:02,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:23:02,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:23:02,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:23:02,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,227 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 00:23:02,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:23:02,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:23:02,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:23:02,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:23:02,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (1/1) ... [2024-10-15 00:23:02,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:23:02,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:23:02,268 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-10-15 00:23:02,290 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-10-15 00:23:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:23:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:23:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:23:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:23:02,406 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:23:02,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:23:02,604 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-15 00:23:02,605 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:23:02,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:23:02,615 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:23:02,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:02 BoogieIcfgContainer [2024-10-15 00:23:02,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:23:02,617 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:23:02,617 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:23:02,620 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:23:02,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:02,621 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:23:01" (1/3) ... [2024-10-15 00:23:02,622 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c77148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:23:02, skipping insertion in model container [2024-10-15 00:23:02,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:02,622 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:23:02" (2/3) ... [2024-10-15 00:23:02,622 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c77148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:23:02, skipping insertion in model container [2024-10-15 00:23:02,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:23:02,623 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:02" (3/3) ... [2024-10-15 00:23:02,624 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2024-10-15 00:23:02,669 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:23:02,669 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:23:02,669 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:23:02,670 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:23:02,670 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:23:02,670 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:23:02,670 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:23:02,670 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:23:02,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:02,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2024-10-15 00:23:02,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:02,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:02,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:02,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:02,703 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:23:02,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:02,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2024-10-15 00:23:02,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:02,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:02,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:02,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:02,715 INFO L745 eck$LassoCheckResult]: Stem: 46#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 32#L183-1true [2024-10-15 00:23:02,717 INFO L747 eck$LassoCheckResult]: Loop: 32#L183-1true assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 17#L49true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 33#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L82-1true assume !(0 != main_~p3~0#1); 8#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 34#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 11#L94-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 31#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 25#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 41#L114-1true assume !(0 != main_~p11~0#1); 30#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13#L122-1true assume !(0 != main_~p1~0#1); 27#L128-1true assume !(0 != main_~p2~0#1); 4#L133-1true assume !(0 != main_~p3~0#1); 3#L138-1true assume !(0 != main_~p4~0#1); 26#L143-1true assume !(0 != main_~p5~0#1); 5#L148-1true assume !(0 != main_~p6~0#1); 22#L153-1true assume !(0 != main_~p7~0#1); 38#L158-1true assume !(0 != main_~p8~0#1); 24#L163-1true assume !(0 != main_~p9~0#1); 40#L168-1true assume !(0 != main_~p10~0#1); 18#L173-1true assume !(0 != main_~p11~0#1); 7#L178-1true assume !(0 != main_~p12~0#1); 32#L183-1true [2024-10-15 00:23:02,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:23:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005854843] [2024-10-15 00:23:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:02,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:02,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2024-10-15 00:23:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096690280] [2024-10-15 00:23:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096690280] [2024-10-15 00:23:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096690280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438761057] [2024-10-15 00:23:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:02,968 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:02,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:02,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:02,997 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,044 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2024-10-15 00:23:03,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 153 transitions. [2024-10-15 00:23:03,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2024-10-15 00:23:03,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 77 states and 123 transitions. [2024-10-15 00:23:03,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-10-15 00:23:03,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-10-15 00:23:03,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2024-10-15 00:23:03,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-15 00:23:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2024-10-15 00:23:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-15 00:23:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-15 00:23:03,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-15 00:23:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,089 INFO L425 stractBuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-15 00:23:03,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:23:03,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2024-10-15 00:23:03,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2024-10-15 00:23:03,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,096 INFO L745 eck$LassoCheckResult]: Stem: 183#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 152#L183-1 [2024-10-15 00:23:03,097 INFO L747 eck$LassoCheckResult]: Loop: 152#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 166#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 167#L78 assume !(0 != main_~p1~0#1); 194#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 193#L82-1 assume !(0 != main_~p3~0#1); 192#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 181#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 157#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 158#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 170#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 189#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 188#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 187#L114-1 assume !(0 != main_~p11~0#1); 186#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 184#L122-1 assume !(0 != main_~p1~0#1); 185#L128-1 assume !(0 != main_~p2~0#1); 215#L133-1 assume !(0 != main_~p3~0#1); 213#L138-1 assume !(0 != main_~p4~0#1); 211#L143-1 assume !(0 != main_~p5~0#1); 209#L148-1 assume !(0 != main_~p6~0#1); 207#L153-1 assume !(0 != main_~p7~0#1); 205#L158-1 assume !(0 != main_~p8~0#1); 203#L163-1 assume !(0 != main_~p9~0#1); 201#L168-1 assume !(0 != main_~p10~0#1); 198#L173-1 assume !(0 != main_~p11~0#1); 197#L178-1 assume !(0 != main_~p12~0#1); 152#L183-1 [2024-10-15 00:23:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:23:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822896186] [2024-10-15 00:23:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2024-10-15 00:23:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037471055] [2024-10-15 00:23:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037471055] [2024-10-15 00:23:03,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037471055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555279129] [2024-10-15 00:23:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,177 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,178 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,198 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2024-10-15 00:23:03,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2024-10-15 00:23:03,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2024-10-15 00:23:03,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2024-10-15 00:23:03,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2024-10-15 00:23:03,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2024-10-15 00:23:03,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2024-10-15 00:23:03,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-10-15 00:23:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2024-10-15 00:23:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-15 00:23:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2024-10-15 00:23:03,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-10-15 00:23:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,214 INFO L425 stractBuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2024-10-15 00:23:03,214 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:23:03,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2024-10-15 00:23:03,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2024-10-15 00:23:03,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,218 INFO L745 eck$LassoCheckResult]: Stem: 424#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 385#L183-1 [2024-10-15 00:23:03,219 INFO L747 eck$LassoCheckResult]: Loop: 385#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 447#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 445#L78 assume !(0 != main_~p1~0#1); 443#L78-2 assume !(0 != main_~p2~0#1); 444#L82-1 assume !(0 != main_~p3~0#1); 490#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 438#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 439#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 434#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 435#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 432#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 433#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 422#L114-1 assume !(0 != main_~p11~0#1); 423#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 425#L122-1 assume !(0 != main_~p1~0#1); 426#L128-1 assume !(0 != main_~p2~0#1); 489#L133-1 assume !(0 != main_~p3~0#1); 487#L138-1 assume !(0 != main_~p4~0#1); 483#L143-1 assume !(0 != main_~p5~0#1); 479#L148-1 assume !(0 != main_~p6~0#1); 475#L153-1 assume !(0 != main_~p7~0#1); 471#L158-1 assume !(0 != main_~p8~0#1); 467#L163-1 assume !(0 != main_~p9~0#1); 459#L168-1 assume !(0 != main_~p10~0#1); 454#L173-1 assume !(0 != main_~p11~0#1); 451#L178-1 assume !(0 != main_~p12~0#1); 385#L183-1 [2024-10-15 00:23:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:23:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961266670] [2024-10-15 00:23:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2024-10-15 00:23:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345112060] [2024-10-15 00:23:03,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345112060] [2024-10-15 00:23:03,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345112060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815927233] [2024-10-15 00:23:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,299 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,300 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,323 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2024-10-15 00:23:03,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2024-10-15 00:23:03,325 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2024-10-15 00:23:03,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2024-10-15 00:23:03,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-15 00:23:03,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-15 00:23:03,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2024-10-15 00:23:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-10-15 00:23:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2024-10-15 00:23:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-10-15 00:23:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2024-10-15 00:23:03,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-10-15 00:23:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-10-15 00:23:03,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:23:03,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2024-10-15 00:23:03,363 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2024-10-15 00:23:03,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,364 INFO L745 eck$LassoCheckResult]: Stem: 871#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 830#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 831#L183-1 [2024-10-15 00:23:03,364 INFO L747 eck$LassoCheckResult]: Loop: 831#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 885#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 882#L78 assume !(0 != main_~p1~0#1); 883#L78-2 assume !(0 != main_~p2~0#1); 961#L82-1 assume !(0 != main_~p3~0#1); 957#L86-1 assume !(0 != main_~p4~0#1); 954#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 951#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 948#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 945#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 942#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 939#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 936#L114-1 assume !(0 != main_~p11~0#1); 934#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 931#L122-1 assume !(0 != main_~p1~0#1); 928#L128-1 assume !(0 != main_~p2~0#1); 926#L133-1 assume !(0 != main_~p3~0#1); 921#L138-1 assume !(0 != main_~p4~0#1); 918#L143-1 assume !(0 != main_~p5~0#1); 914#L148-1 assume !(0 != main_~p6~0#1); 910#L153-1 assume !(0 != main_~p7~0#1); 906#L158-1 assume !(0 != main_~p8~0#1); 902#L163-1 assume !(0 != main_~p9~0#1); 898#L168-1 assume !(0 != main_~p10~0#1); 893#L173-1 assume !(0 != main_~p11~0#1); 890#L178-1 assume !(0 != main_~p12~0#1); 831#L183-1 [2024-10-15 00:23:03,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:23:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393066929] [2024-10-15 00:23:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2024-10-15 00:23:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410827250] [2024-10-15 00:23:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410827250] [2024-10-15 00:23:03,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410827250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949446572] [2024-10-15 00:23:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,425 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,426 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,448 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2024-10-15 00:23:03,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2024-10-15 00:23:03,452 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2024-10-15 00:23:03,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2024-10-15 00:23:03,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2024-10-15 00:23:03,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2024-10-15 00:23:03,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2024-10-15 00:23:03,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-10-15 00:23:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2024-10-15 00:23:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2024-10-15 00:23:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2024-10-15 00:23:03,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-10-15 00:23:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,524 INFO L425 stractBuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2024-10-15 00:23:03,524 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:23:03,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2024-10-15 00:23:03,526 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2024-10-15 00:23:03,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,528 INFO L745 eck$LassoCheckResult]: Stem: 1747#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 1710#L183-1 [2024-10-15 00:23:03,528 INFO L747 eck$LassoCheckResult]: Loop: 1710#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1765#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 1766#L78 assume !(0 != main_~p1~0#1); 1865#L78-2 assume !(0 != main_~p2~0#1); 1863#L82-1 assume !(0 != main_~p3~0#1); 1859#L86-1 assume !(0 != main_~p4~0#1); 1857#L90-1 assume !(0 != main_~p5~0#1); 1855#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1853#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1851#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1849#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1847#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1845#L114-1 assume !(0 != main_~p11~0#1); 1843#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1839#L122-1 assume !(0 != main_~p1~0#1); 1835#L128-1 assume !(0 != main_~p2~0#1); 1832#L133-1 assume !(0 != main_~p3~0#1); 1827#L138-1 assume !(0 != main_~p4~0#1); 1824#L143-1 assume !(0 != main_~p5~0#1); 1825#L148-1 assume !(0 != main_~p6~0#1); 1802#L153-1 assume !(0 != main_~p7~0#1); 1801#L158-1 assume !(0 != main_~p8~0#1); 1791#L163-1 assume !(0 != main_~p9~0#1); 1787#L168-1 assume !(0 != main_~p10~0#1); 1786#L173-1 assume !(0 != main_~p11~0#1); 1775#L178-1 assume !(0 != main_~p12~0#1); 1710#L183-1 [2024-10-15 00:23:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-15 00:23:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157908581] [2024-10-15 00:23:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2024-10-15 00:23:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403585351] [2024-10-15 00:23:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403585351] [2024-10-15 00:23:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403585351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207331822] [2024-10-15 00:23:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,599 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,600 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,617 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2024-10-15 00:23:03,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2024-10-15 00:23:03,623 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2024-10-15 00:23:03,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2024-10-15 00:23:03,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2024-10-15 00:23:03,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2024-10-15 00:23:03,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2024-10-15 00:23:03,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-10-15 00:23:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2024-10-15 00:23:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-10-15 00:23:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2024-10-15 00:23:03,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-10-15 00:23:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,649 INFO L425 stractBuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2024-10-15 00:23:03,650 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:23:03,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2024-10-15 00:23:03,654 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2024-10-15 00:23:03,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,656 INFO L745 eck$LassoCheckResult]: Stem: 3479#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 3430#L183-1 [2024-10-15 00:23:03,656 INFO L747 eck$LassoCheckResult]: Loop: 3430#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3774#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 3772#L78 assume !(0 != main_~p1~0#1); 3770#L78-2 assume !(0 != main_~p2~0#1); 3765#L82-1 assume !(0 != main_~p3~0#1); 3760#L86-1 assume !(0 != main_~p4~0#1); 3756#L90-1 assume !(0 != main_~p5~0#1); 3752#L94-1 assume !(0 != main_~p6~0#1); 3748#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3745#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3742#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3739#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3736#L114-1 assume !(0 != main_~p11~0#1); 3733#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3728#L122-1 assume !(0 != main_~p1~0#1); 3723#L128-1 assume !(0 != main_~p2~0#1); 3722#L133-1 assume !(0 != main_~p3~0#1); 3713#L138-1 assume !(0 != main_~p4~0#1); 3714#L143-1 assume !(0 != main_~p5~0#1); 3806#L148-1 assume !(0 != main_~p6~0#1); 3803#L153-1 assume !(0 != main_~p7~0#1); 3799#L158-1 assume !(0 != main_~p8~0#1); 3795#L163-1 assume !(0 != main_~p9~0#1); 3791#L168-1 assume !(0 != main_~p10~0#1); 3788#L173-1 assume !(0 != main_~p11~0#1); 3780#L178-1 assume !(0 != main_~p12~0#1); 3430#L183-1 [2024-10-15 00:23:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-15 00:23:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775586858] [2024-10-15 00:23:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2024-10-15 00:23:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606546585] [2024-10-15 00:23:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606546585] [2024-10-15 00:23:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606546585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124520450] [2024-10-15 00:23:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,713 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,714 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,745 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2024-10-15 00:23:03,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2024-10-15 00:23:03,767 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2024-10-15 00:23:03,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2024-10-15 00:23:03,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2024-10-15 00:23:03,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2024-10-15 00:23:03,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2024-10-15 00:23:03,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:03,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-10-15 00:23:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2024-10-15 00:23:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2024-10-15 00:23:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2024-10-15 00:23:03,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-10-15 00:23:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:03,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2024-10-15 00:23:03,820 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:23:03,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2024-10-15 00:23:03,829 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2024-10-15 00:23:03,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:03,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:03,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:03,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:03,831 INFO L745 eck$LassoCheckResult]: Stem: 6859#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6816#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 6817#L183-1 [2024-10-15 00:23:03,831 INFO L747 eck$LassoCheckResult]: Loop: 6817#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6930#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 6928#L78 assume !(0 != main_~p1~0#1); 6924#L78-2 assume !(0 != main_~p2~0#1); 6922#L82-1 assume !(0 != main_~p3~0#1); 6918#L86-1 assume !(0 != main_~p4~0#1); 6914#L90-1 assume !(0 != main_~p5~0#1); 6910#L94-1 assume !(0 != main_~p6~0#1); 6906#L98-1 assume !(0 != main_~p7~0#1); 6904#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6902#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6900#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6898#L114-1 assume !(0 != main_~p11~0#1); 6896#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6893#L122-1 assume !(0 != main_~p1~0#1); 6894#L128-1 assume !(0 != main_~p2~0#1); 6970#L133-1 assume !(0 != main_~p3~0#1); 6965#L138-1 assume !(0 != main_~p4~0#1); 6961#L143-1 assume !(0 != main_~p5~0#1); 6957#L148-1 assume !(0 != main_~p6~0#1); 6953#L153-1 assume !(0 != main_~p7~0#1); 6950#L158-1 assume !(0 != main_~p8~0#1); 6946#L163-1 assume !(0 != main_~p9~0#1); 6942#L168-1 assume !(0 != main_~p10~0#1); 6937#L173-1 assume !(0 != main_~p11~0#1); 6934#L178-1 assume !(0 != main_~p12~0#1); 6817#L183-1 [2024-10-15 00:23:03,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-15 00:23:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201363347] [2024-10-15 00:23:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:03,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2024-10-15 00:23:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001000487] [2024-10-15 00:23:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001000487] [2024-10-15 00:23:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001000487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:03,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036689347] [2024-10-15 00:23:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:03,883 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:03,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:03,883 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:03,932 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2024-10-15 00:23:03,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2024-10-15 00:23:03,985 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2024-10-15 00:23:04,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2024-10-15 00:23:04,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2024-10-15 00:23:04,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2024-10-15 00:23:04,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2024-10-15 00:23:04,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:04,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-10-15 00:23:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2024-10-15 00:23:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2024-10-15 00:23:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2024-10-15 00:23:04,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-10-15 00:23:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:04,105 INFO L425 stractBuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2024-10-15 00:23:04,105 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:23:04,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2024-10-15 00:23:04,122 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2024-10-15 00:23:04,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:04,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:04,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:04,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:04,123 INFO L745 eck$LassoCheckResult]: Stem: 13530#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 13483#L183-1 [2024-10-15 00:23:04,123 INFO L747 eck$LassoCheckResult]: Loop: 13483#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 14082#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 14080#L78 assume !(0 != main_~p1~0#1); 14077#L78-2 assume !(0 != main_~p2~0#1); 14075#L82-1 assume !(0 != main_~p3~0#1); 14071#L86-1 assume !(0 != main_~p4~0#1); 13974#L90-1 assume !(0 != main_~p5~0#1); 13975#L94-1 assume !(0 != main_~p6~0#1); 14064#L98-1 assume !(0 != main_~p7~0#1); 14060#L102-1 assume !(0 != main_~p8~0#1); 14055#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 14052#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 14050#L114-1 assume !(0 != main_~p11~0#1); 14049#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14048#L122-1 assume !(0 != main_~p1~0#1); 14045#L128-1 assume !(0 != main_~p2~0#1); 14043#L133-1 assume !(0 != main_~p3~0#1); 13967#L138-1 assume !(0 != main_~p4~0#1); 13968#L143-1 assume !(0 != main_~p5~0#1); 14021#L148-1 assume !(0 != main_~p6~0#1); 14114#L153-1 assume !(0 != main_~p7~0#1); 14112#L158-1 assume !(0 != main_~p8~0#1); 14109#L163-1 assume !(0 != main_~p9~0#1); 14105#L168-1 assume !(0 != main_~p10~0#1); 14102#L173-1 assume !(0 != main_~p11~0#1); 14086#L178-1 assume !(0 != main_~p12~0#1); 13483#L183-1 [2024-10-15 00:23:04,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-15 00:23:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225652558] [2024-10-15 00:23:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:04,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:04,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:04,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2024-10-15 00:23:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947061588] [2024-10-15 00:23:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947061588] [2024-10-15 00:23:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947061588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450894910] [2024-10-15 00:23:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:04,155 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:04,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:04,155 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:04,187 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2024-10-15 00:23:04,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2024-10-15 00:23:04,225 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2024-10-15 00:23:04,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2024-10-15 00:23:04,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2024-10-15 00:23:04,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2024-10-15 00:23:04,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2024-10-15 00:23:04,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:04,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-10-15 00:23:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2024-10-15 00:23:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2024-10-15 00:23:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2024-10-15 00:23:04,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-10-15 00:23:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:04,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2024-10-15 00:23:04,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:23:04,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2024-10-15 00:23:04,527 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2024-10-15 00:23:04,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:04,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:04,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:04,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:04,528 INFO L745 eck$LassoCheckResult]: Stem: 26658#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 26611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 26612#L183-1 [2024-10-15 00:23:04,528 INFO L747 eck$LassoCheckResult]: Loop: 26612#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27038#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 27036#L78 assume !(0 != main_~p1~0#1); 27031#L78-2 assume !(0 != main_~p2~0#1); 27025#L82-1 assume !(0 != main_~p3~0#1); 27017#L86-1 assume !(0 != main_~p4~0#1); 27011#L90-1 assume !(0 != main_~p5~0#1); 27005#L94-1 assume !(0 != main_~p6~0#1); 26997#L98-1 assume !(0 != main_~p7~0#1); 26989#L102-1 assume !(0 != main_~p8~0#1); 26983#L106-1 assume !(0 != main_~p9~0#1); 26979#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26826#L114-1 assume !(0 != main_~p11~0#1); 26822#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26823#L122-1 assume !(0 != main_~p1~0#1); 26969#L128-1 assume !(0 != main_~p2~0#1); 26959#L133-1 assume !(0 != main_~p3~0#1); 26958#L138-1 assume !(0 != main_~p4~0#1); 26945#L143-1 assume !(0 != main_~p5~0#1); 26947#L148-1 assume !(0 != main_~p6~0#1); 27061#L153-1 assume !(0 != main_~p7~0#1); 27057#L158-1 assume !(0 != main_~p8~0#1); 27053#L163-1 assume !(0 != main_~p9~0#1); 27050#L168-1 assume !(0 != main_~p10~0#1); 27045#L173-1 assume !(0 != main_~p11~0#1); 27042#L178-1 assume !(0 != main_~p12~0#1); 26612#L183-1 [2024-10-15 00:23:04,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-15 00:23:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:04,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28696286] [2024-10-15 00:23:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:04,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:04,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2024-10-15 00:23:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976909774] [2024-10-15 00:23:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:04,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:04,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976909774] [2024-10-15 00:23:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976909774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:23:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164208011] [2024-10-15 00:23:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:04,567 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:04,568 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:04,618 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2024-10-15 00:23:04,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2024-10-15 00:23:04,692 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2024-10-15 00:23:04,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2024-10-15 00:23:04,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2024-10-15 00:23:04,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2024-10-15 00:23:04,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2024-10-15 00:23:04,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:04,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-10-15 00:23:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2024-10-15 00:23:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2024-10-15 00:23:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2024-10-15 00:23:05,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-10-15 00:23:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:05,190 INFO L425 stractBuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2024-10-15 00:23:05,190 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:23:05,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2024-10-15 00:23:05,241 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2024-10-15 00:23:05,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:05,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:05,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:05,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:05,243 INFO L745 eck$LassoCheckResult]: Stem: 52526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 52477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 52478#L183-1 [2024-10-15 00:23:05,243 INFO L747 eck$LassoCheckResult]: Loop: 52478#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 52903#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 52901#L78 assume !(0 != main_~p1~0#1); 52897#L78-2 assume !(0 != main_~p2~0#1); 52894#L82-1 assume !(0 != main_~p3~0#1); 52886#L86-1 assume !(0 != main_~p4~0#1); 52878#L90-1 assume !(0 != main_~p5~0#1); 52879#L94-1 assume !(0 != main_~p6~0#1); 52876#L98-1 assume !(0 != main_~p7~0#1); 52868#L102-1 assume !(0 != main_~p8~0#1); 52860#L106-1 assume !(0 != main_~p9~0#1); 52852#L110-1 assume !(0 != main_~p10~0#1); 52845#L114-1 assume !(0 != main_~p11~0#1); 52716#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 52717#L122-1 assume !(0 != main_~p1~0#1); 52824#L128-1 assume !(0 != main_~p2~0#1); 52826#L133-1 assume !(0 != main_~p3~0#1); 52812#L138-1 assume !(0 != main_~p4~0#1); 52813#L143-1 assume !(0 != main_~p5~0#1); 52930#L148-1 assume !(0 != main_~p6~0#1); 52926#L153-1 assume !(0 != main_~p7~0#1); 52922#L158-1 assume !(0 != main_~p8~0#1); 52918#L163-1 assume !(0 != main_~p9~0#1); 52914#L168-1 assume !(0 != main_~p10~0#1); 52910#L173-1 assume !(0 != main_~p11~0#1); 52907#L178-1 assume !(0 != main_~p12~0#1); 52478#L183-1 [2024-10-15 00:23:05,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-10-15 00:23:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847493894] [2024-10-15 00:23:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:05,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:05,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2024-10-15 00:23:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964376836] [2024-10-15 00:23:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:23:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:23:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:23:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964376836] [2024-10-15 00:23:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964376836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:23:05,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:23:05,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:23:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951361056] [2024-10-15 00:23:05,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:23:05,282 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:23:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:23:05,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:23:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:23:05,283 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:23:05,494 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2024-10-15 00:23:05,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2024-10-15 00:23:05,622 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2024-10-15 00:23:05,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2024-10-15 00:23:05,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2024-10-15 00:23:05,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2024-10-15 00:23:05,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2024-10-15 00:23:05,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:23:05,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-10-15 00:23:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2024-10-15 00:23:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2024-10-15 00:23:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 33794 states have (on average 1.4242173166834349) internal successors, (48130), 33793 states have internal predecessors, (48130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:23:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2024-10-15 00:23:06,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-10-15 00:23:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:23:06,533 INFO L425 stractBuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2024-10-15 00:23:06,533 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:23:06,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2024-10-15 00:23:06,639 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2024-10-15 00:23:06,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:23:06,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:23:06,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:23:06,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:23:06,640 INFO L745 eck$LassoCheckResult]: Stem: 103487#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 103431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 103432#L183-1 [2024-10-15 00:23:06,641 INFO L747 eck$LassoCheckResult]: Loop: 103432#L183-1 assume !false;havoc main_#t~nondet16#1;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103593#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 103591#L78 assume !(0 != main_~p1~0#1); 103587#L78-2 assume !(0 != main_~p2~0#1); 103585#L82-1 assume !(0 != main_~p3~0#1); 103581#L86-1 assume !(0 != main_~p4~0#1); 103577#L90-1 assume !(0 != main_~p5~0#1); 103573#L94-1 assume !(0 != main_~p6~0#1); 103569#L98-1 assume !(0 != main_~p7~0#1); 103565#L102-1 assume !(0 != main_~p8~0#1); 103561#L106-1 assume !(0 != main_~p9~0#1); 103557#L110-1 assume !(0 != main_~p10~0#1); 103555#L114-1 assume !(0 != main_~p11~0#1); 103551#L118-1 assume !(0 != main_~p12~0#1); 103548#L122-1 assume !(0 != main_~p1~0#1); 103549#L128-1 assume !(0 != main_~p2~0#1); 103633#L133-1 assume !(0 != main_~p3~0#1); 103628#L138-1 assume !(0 != main_~p4~0#1); 103624#L143-1 assume !(0 != main_~p5~0#1); 103620#L148-1 assume !(0 != main_~p6~0#1); 103616#L153-1 assume !(0 != main_~p7~0#1); 103612#L158-1 assume !(0 != main_~p8~0#1); 103608#L163-1 assume !(0 != main_~p9~0#1); 103604#L168-1 assume !(0 != main_~p10~0#1); 103600#L173-1 assume !(0 != main_~p11~0#1); 103596#L178-1 assume !(0 != main_~p12~0#1); 103432#L183-1 [2024-10-15 00:23:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-10-15 00:23:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301213037] [2024-10-15 00:23:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:06,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2024-10-15 00:23:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535763789] [2024-10-15 00:23:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:23:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2024-10-15 00:23:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:23:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417987655] [2024-10-15 00:23:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:23:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:23:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:06,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:23:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:23:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:23:07,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:23:07 BoogieIcfgContainer [2024-10-15 00:23:07,196 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:23:07,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:23:07,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:23:07,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:23:07,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:23:02" (3/4) ... [2024-10-15 00:23:07,198 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:23:07,236 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:23:07,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:23:07,236 INFO L158 Benchmark]: Toolchain (without parser) took 5263.99ms. Allocated memory was 138.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 67.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 217.2MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.15ms. Allocated memory is still 138.4MB. Free memory was 67.3MB in the beginning and 55.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.88ms. Allocated memory is still 138.4MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: Boogie Preprocessor took 30.36ms. Allocated memory is still 138.4MB. Free memory was 53.6MB in the beginning and 51.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: RCFGBuilder took 376.90ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 51.5MB in the beginning and 127.3MB in the end (delta: -75.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,237 INFO L158 Benchmark]: BuchiAutomizer took 4579.72ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 127.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 242.4MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,238 INFO L158 Benchmark]: Witness Printer took 39.13ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:23:07,239 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.13ms. Allocated memory is still 138.4MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.15ms. Allocated memory is still 138.4MB. Free memory was 67.3MB in the beginning and 55.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.88ms. Allocated memory is still 138.4MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.36ms. Allocated memory is still 138.4MB. Free memory was 53.6MB in the beginning and 51.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.90ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 51.5MB in the beginning and 127.3MB in the end (delta: -75.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4579.72ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 127.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 242.4MB. Max. memory is 16.1GB. * Witness Printer took 39.13ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 3.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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.8s 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, 494 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 1550 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 956 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 00:23:07,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)