./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:21:07,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:21:07,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:21:07,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:21:07,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:21:07,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:21:07,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:21:07,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:21:07,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:21:07,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:21:07,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:21:07,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:21:07,461 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:21:07,461 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:21:07,461 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:21:07,462 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:21:07,462 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:21:07,462 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:21:07,462 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:21:07,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:21:07,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:21:07,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:21:07,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:21:07,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:21:07,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:21:07,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:21:07,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:21:07,471 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:21:07,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:21:07,471 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:21:07,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:21:07,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:21:07,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:21:07,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:21:07,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:21:07,473 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:21:07,473 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2024-10-12 00:21:07,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:21:07,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:21:07,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:21:07,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:21:07,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:21:07,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2024-10-12 00:21:09,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:21:09,747 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:21:09,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2024-10-12 00:21:09,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07ca3af98/234a8be2d51d4d4c870f58b2b6462316/FLAGf1ce12a1b [2024-10-12 00:21:09,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07ca3af98/234a8be2d51d4d4c870f58b2b6462316 [2024-10-12 00:21:09,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:21:09,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:21:09,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:21:09,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:21:09,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:21:09,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:21:09" (1/1) ... [2024-10-12 00:21:09,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e015c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:09, skipping insertion in model container [2024-10-12 00:21:09,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:21:09" (1/1) ... [2024-10-12 00:21:09,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:21:10,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:21:10,201 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:21:10,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:21:10,302 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:21:10,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10 WrapperNode [2024-10-12 00:21:10,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:21:10,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:21:10,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:21:10,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:21:10,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,350 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-10-12 00:21:10,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:21:10,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:21:10,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:21:10,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:21:10,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,390 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-10-12 00:21:10,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:21:10,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:21:10,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:21:10,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:21:10,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (1/1) ... [2024-10-12 00:21:10,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:21:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:21:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:21:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:21:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:21:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:21:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:21:10,602 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:21:10,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:21:10,754 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 00:21:10,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:21:10,769 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:21:10,769 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:21:10,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:21:10 BoogieIcfgContainer [2024-10-12 00:21:10,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:21:10,771 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:21:10,774 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:21:10,778 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:21:10,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:10,779 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:21:09" (1/3) ... [2024-10-12 00:21:10,780 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11895ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:21:10, skipping insertion in model container [2024-10-12 00:21:10,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:10,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:10" (2/3) ... [2024-10-12 00:21:10,781 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11895ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:21:10, skipping insertion in model container [2024-10-12 00:21:10,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:10,781 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:21:10" (3/3) ... [2024-10-12 00:21:10,782 INFO L332 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2024-10-12 00:21:10,844 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:21:10,844 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:21:10,844 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:21:10,844 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:21:10,845 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:21:10,845 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:21:10,845 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:21:10,845 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:21:10,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:10,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:21:10,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:10,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:10,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:21:10,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:10,882 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:21:10,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:10,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:21:10,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:10,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:10,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:21:10,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:10,893 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 13#L367true assume !(main_~length~0#1 < 1); 10#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 14#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 16#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 3#L375-3true [2024-10-12 00:21:10,895 INFO L747 eck$LassoCheckResult]: Loop: 3#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 8#L375-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 3#L375-3true [2024-10-12 00:21:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2024-10-12 00:21:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431499515] [2024-10-12 00:21:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:11,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-10-12 00:21:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460958827] [2024-10-12 00:21:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2024-10-12 00:21:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266736948] [2024-10-12 00:21:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:11,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:11,687 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:11,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:11,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:11,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:11,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:11,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:11,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:11,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:11,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2024-10-12 00:21:11,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:11,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:11,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:12,131 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:12,135 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:21:12,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:21:12,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:21:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:21:12,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:21:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:21:12,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:21:12,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:21:12,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:21:12,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:21:12,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:21:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:21:12,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:21:12,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:21:12,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:21:12,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,523 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:21:12,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:12,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:12,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:12,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:12,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:21:12,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:21:12,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:12,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:12,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:12,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:12,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:12,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:12,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:12,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:12,642 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:21:12,642 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-12 00:21:12,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:12,649 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:12,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:21:12,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:12,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:21:12,667 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:12,668 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:21:12,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,702 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:21:12,716 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:21:12,717 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:21:12,717 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-12 00:21:12,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:12,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:21:12,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:12,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:21:12,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:12,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:21:12,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:12,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Result 27 states and 39 transitions. Complement of second has 6 states. [2024-10-12 00:21:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-12 00:21:12,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:21:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:12,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 2 letters. [2024-10-12 00:21:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:12,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:21:12,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:12,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 39 transitions. [2024-10-12 00:21:12,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:12,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 12 states and 16 transitions. [2024-10-12 00:21:12,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:21:12,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:21:12,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2024-10-12 00:21:12,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:12,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:21:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2024-10-12 00:21:12,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:21:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:21:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:21:12,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:21:12,940 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:21:12,940 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:21:12,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-12 00:21:12,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:12,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:12,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:12,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:12,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:12,943 INFO L745 eck$LassoCheckResult]: Stem: 110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 112#L367 assume !(main_~length~0#1 < 1); 104#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 105#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 113#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 106#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 107#L375-4 main_~j~0#1 := 1; 102#L380-2 [2024-10-12 00:21:12,943 INFO L747 eck$LassoCheckResult]: Loop: 102#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 103#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 102#L380-2 [2024-10-12 00:21:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2024-10-12 00:21:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314315540] [2024-10-12 00:21:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314315540] [2024-10-12 00:21:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314315540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:21:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:21:13,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:21:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730114705] [2024-10-12 00:21:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:21:13,098 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:13,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2024-10-12 00:21:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853487982] [2024-10-12 00:21:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:21:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:21:13,206 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:13,233 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-12 00:21:13,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-12 00:21:13,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:13,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-10-12 00:21:13,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:21:13,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:21:13,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-10-12 00:21:13,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:13,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:21:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-10-12 00:21:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-10-12 00:21:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-12 00:21:13,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:21:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:21:13,238 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:21:13,238 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:21:13,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-10-12 00:21:13,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:13,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:13,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:13,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:13,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:13,239 INFO L745 eck$LassoCheckResult]: Stem: 142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 144#L367 assume !(main_~length~0#1 < 1); 140#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 141#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 145#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 136#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 137#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 138#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 139#L375-4 main_~j~0#1 := 1; 134#L380-2 [2024-10-12 00:21:13,239 INFO L747 eck$LassoCheckResult]: Loop: 134#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 135#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 134#L380-2 [2024-10-12 00:21:13,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2024-10-12 00:21:13,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745724564] [2024-10-12 00:21:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2024-10-12 00:21:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685407581] [2024-10-12 00:21:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2024-10-12 00:21:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999255356] [2024-10-12 00:21:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999255356] [2024-10-12 00:21:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999255356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167014782] [2024-10-12 00:21:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:13,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-12 00:21:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:21:13,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:13,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167014782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:13,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-12 00:21:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348917591] [2024-10-12 00:21:13,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:13,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:21:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:21:13,582 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:13,662 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-12 00:21:13,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-10-12 00:21:13,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:13,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2024-10-12 00:21:13,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:21:13,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:21:13,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-10-12 00:21:13,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:13,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-12 00:21:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-10-12 00:21:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 00:21:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-12 00:21:13,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-12 00:21:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:21:13,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-12 00:21:13,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:21:13,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-10-12 00:21:13,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:13,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:13,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:13,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:13,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:13,672 INFO L745 eck$LassoCheckResult]: Stem: 262#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 264#L367 assume !(main_~length~0#1 < 1); 256#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 257#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 265#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 258#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 259#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 260#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 261#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 267#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 266#L375-4 main_~j~0#1 := 1; 254#L380-2 [2024-10-12 00:21:13,672 INFO L747 eck$LassoCheckResult]: Loop: 254#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 255#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 254#L380-2 [2024-10-12 00:21:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2024-10-12 00:21:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841528995] [2024-10-12 00:21:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2024-10-12 00:21:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164605136] [2024-10-12 00:21:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2024-10-12 00:21:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809678623] [2024-10-12 00:21:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:13,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:14,063 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:14,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:14,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:14,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:14,064 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:14,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:14,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:14,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2024-10-12 00:21:14,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:14,065 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:14,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:14,575 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:14,575 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:14,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:21:14,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:21:14,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,614 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:21:14,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:21:14,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,657 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:21:14,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:21:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,693 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:21:14,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:14,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,727 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:21:14,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,761 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:21:14,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,795 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:21:14,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:14,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,830 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:21:14,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:21:14,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,869 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:21:14,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:14,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:21:14,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,913 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:21:14,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:14,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:14,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:14,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:14,966 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:14,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:21:14,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:14,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:14,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:14,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:14,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:14,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:14,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:14,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:15,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:15,020 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:15,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:21:15,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:15,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:15,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:15,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:15,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:15,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:15,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:15,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:15,094 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-12 00:21:15,094 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-12 00:21:15,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:15,120 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:15,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:21:15,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:15,152 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:21:15,152 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:15,153 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2) = -2*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2024-10-12 00:21:15,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:15,185 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 00:21:15,189 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:21:15,189 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:21:15,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:15,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:21:15,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:15,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:21:15,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:15,372 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:21:15,373 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:15,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 6 states. [2024-10-12 00:21:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-12 00:21:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-12 00:21:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-12 00:21:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:21:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:15,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-10-12 00:21:15,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:15,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2024-10-12 00:21:15,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:21:15,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:21:15,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-12 00:21:15,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:15,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 00:21:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-12 00:21:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 00:21:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-12 00:21:15,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 00:21:15,439 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 00:21:15,439 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:21:15,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2024-10-12 00:21:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:15,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:15,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:15,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:15,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:15,442 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 390#L367 assume !(main_~length~0#1 < 1); 384#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 385#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 391#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 386#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 387#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 388#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 389#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 396#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 394#L375-4 main_~j~0#1 := 1; 395#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 383#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 379#L380-2 [2024-10-12 00:21:15,442 INFO L747 eck$LassoCheckResult]: Loop: 379#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 380#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 379#L380-2 [2024-10-12 00:21:15,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2024-10-12 00:21:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628653748] [2024-10-12 00:21:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:15,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:21:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628653748] [2024-10-12 00:21:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628653748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146607548] [2024-10-12 00:21:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:15,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:15,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:15,883 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:15,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-12 00:21:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:15,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:21:15,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:15,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:21:16,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-12 00:21:16,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:21:16,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-10-12 00:21:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:16,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:16,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-10-12 00:21:16,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:21:16,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 726 treesize of output 630 [2024-10-12 00:21:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146607548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:16,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-10-12 00:21:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532359920] [2024-10-12 00:21:16,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:16,285 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:16,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2024-10-12 00:21:16,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780120484] [2024-10-12 00:21:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:16,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:16,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 00:21:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-12 00:21:16,359 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:16,586 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-12 00:21:16,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-10-12 00:21:16,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:16,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 25 transitions. [2024-10-12 00:21:16,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:21:16,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:21:16,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-12 00:21:16,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:16,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 00:21:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-12 00:21:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-12 00:21:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-12 00:21:16,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-12 00:21:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:21:16,591 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-12 00:21:16,591 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:21:16,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-12 00:21:16,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:16,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:16,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:16,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:16,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:16,592 INFO L745 eck$LassoCheckResult]: Stem: 538#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 540#L367 assume !(main_~length~0#1 < 1); 535#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 536#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 541#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 531#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 532#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 533#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 534#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 543#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 542#L375-4 main_~j~0#1 := 1; 527#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 528#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 529#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 530#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 537#L380-2 [2024-10-12 00:21:16,592 INFO L747 eck$LassoCheckResult]: Loop: 537#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 544#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 537#L380-2 [2024-10-12 00:21:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2024-10-12 00:21:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77363677] [2024-10-12 00:21:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77363677] [2024-10-12 00:21:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77363677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750724322] [2024-10-12 00:21:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:16,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:16,668 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:16,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-12 00:21:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:16,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:21:16,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:16,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750724322] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:16,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-12 00:21:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075414940] [2024-10-12 00:21:16,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:16,801 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:16,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2024-10-12 00:21:16,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:16,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540692271] [2024-10-12 00:21:16,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:16,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:16,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:21:16,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:21:16,913 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:16,953 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-12 00:21:16,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2024-10-12 00:21:16,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:16,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2024-10-12 00:21:16,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:21:16,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:21:16,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-10-12 00:21:16,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:16,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-12 00:21:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-10-12 00:21:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-12 00:21:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-12 00:21:16,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-12 00:21:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:21:16,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-12 00:21:16,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:21:16,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-10-12 00:21:16,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:16,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:16,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:16,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:16,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:16,959 INFO L745 eck$LassoCheckResult]: Stem: 686#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 688#L367 assume !(main_~length~0#1 < 1); 680#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 681#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 689#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 682#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 683#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 684#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 685#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 694#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 693#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 692#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 690#L375-4 main_~j~0#1 := 1; 691#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 678#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 677#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 679#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 675#L380-2 [2024-10-12 00:21:16,959 INFO L747 eck$LassoCheckResult]: Loop: 675#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 676#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 675#L380-2 [2024-10-12 00:21:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2024-10-12 00:21:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375805247] [2024-10-12 00:21:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375805247] [2024-10-12 00:21:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375805247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371369435] [2024-10-12 00:21:17,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:21:17,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:17,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:17,545 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:17,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-12 00:21:17,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:21:17,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:21:17,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:21:17,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:17,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:21:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-12 00:21:17,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:21:17,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-12 00:21:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:17,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:18,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-12 00:21:18,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:21:18,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 152 [2024-10-12 00:21:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371369435] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:18,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:18,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2024-10-12 00:21:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31915794] [2024-10-12 00:21:18,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:18,157 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:18,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2024-10-12 00:21:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42745209] [2024-10-12 00:21:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:18,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:18,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 00:21:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-10-12 00:21:18,229 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 6 Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:18,526 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-12 00:21:18,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2024-10-12 00:21:18,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:21:18,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 44 transitions. [2024-10-12 00:21:18,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:21:18,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:21:18,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2024-10-12 00:21:18,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:18,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-12 00:21:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2024-10-12 00:21:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-10-12 00:21:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-12 00:21:18,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-12 00:21:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:21:18,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-12 00:21:18,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:21:18,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2024-10-12 00:21:18,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:18,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:18,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:18,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:18,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:18,532 INFO L745 eck$LassoCheckResult]: Stem: 881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 883#L367 assume !(main_~length~0#1 < 1); 877#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 878#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 884#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 873#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 874#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 887#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 893#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 875#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 876#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 891#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 885#L375-4 main_~j~0#1 := 1; 886#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 894#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 871#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 872#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 880#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 879#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 869#L380-2 [2024-10-12 00:21:18,532 INFO L747 eck$LassoCheckResult]: Loop: 869#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 870#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 869#L380-2 [2024-10-12 00:21:18,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1257807801, now seen corresponding path program 3 times [2024-10-12 00:21:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619061044] [2024-10-12 00:21:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619061044] [2024-10-12 00:21:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619061044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233726269] [2024-10-12 00:21:18,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:21:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:18,630 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:18,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-12 00:21:18,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-12 00:21:18,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:21:18,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:21:18,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:18,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233726269] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:18,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2024-10-12 00:21:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899314472] [2024-10-12 00:21:18,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:18,833 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2024-10-12 00:21:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560290000] [2024-10-12 00:21:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:18,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:18,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:21:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:21:18,906 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 9 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:18,965 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-12 00:21:18,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2024-10-12 00:21:18,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:18,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 35 transitions. [2024-10-12 00:21:18,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:21:18,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:21:18,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2024-10-12 00:21:18,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:18,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-12 00:21:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2024-10-12 00:21:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 00:21:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-12 00:21:18,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-12 00:21:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:21:18,971 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-12 00:21:18,971 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:21:18,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-10-12 00:21:18,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:18,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:18,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:18,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:18,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:18,972 INFO L745 eck$LassoCheckResult]: Stem: 1078#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1079#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1080#L367 assume !(main_~length~0#1 < 1); 1070#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1071#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1081#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1072#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1073#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1074#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1075#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1084#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1095#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1094#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1093#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1087#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1088#L375-4 main_~j~0#1 := 1; 1085#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1086#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1068#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1069#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1077#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1076#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1066#L380-2 [2024-10-12 00:21:18,972 INFO L747 eck$LassoCheckResult]: Loop: 1066#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1067#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1066#L380-2 [2024-10-12 00:21:18,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -948777687, now seen corresponding path program 4 times [2024-10-12 00:21:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654140956] [2024-10-12 00:21:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654140956] [2024-10-12 00:21:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654140956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653359521] [2024-10-12 00:21:19,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:21:19,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:19,411 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:19,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-12 00:21:19,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:21:19,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:21:19,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:21:19,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:19,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-12 00:21:19,607 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-12 00:21:19,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-10-12 00:21:20,029 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-10-12 00:21:20,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2024-10-12 00:21:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:20,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:50,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-10-12 00:21:50,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:21:50,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 99 [2024-10-12 00:21:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653359521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:50,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2024-10-12 00:21:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333789751] [2024-10-12 00:21:50,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:50,605 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:21:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 8 times [2024-10-12 00:21:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789451266] [2024-10-12 00:21:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 00:21:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=829, Unknown=1, NotChecked=0, Total=992 [2024-10-12 00:21:50,689 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:03,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-12 00:22:12,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-12 00:22:14,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-12 00:22:23,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-12 00:22:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:23,087 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-10-12 00:22:23,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2024-10-12 00:22:23,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-12 00:22:23,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 41 states and 47 transitions. [2024-10-12 00:22:23,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-12 00:22:23,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:22:23,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-10-12 00:22:23,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:23,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-12 00:22:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-10-12 00:22:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-12 00:22:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-12 00:22:23,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-12 00:22:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 00:22:23,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-12 00:22:23,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:22:23,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2024-10-12 00:22:23,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-10-12 00:22:23,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:23,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:23,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:23,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:23,100 INFO L745 eck$LassoCheckResult]: Stem: 1363#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1365#L367 assume !(main_~length~0#1 < 1); 1360#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1361#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1366#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1356#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1357#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1358#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1359#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1381#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1380#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1379#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1378#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1377#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1376#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1375#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1374#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1371#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1367#L375-4 main_~j~0#1 := 1; 1368#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1387#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1386#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1362#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1351#L380-2 [2024-10-12 00:22:23,101 INFO L747 eck$LassoCheckResult]: Loop: 1351#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1352#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1351#L380-2 [2024-10-12 00:22:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash -885753430, now seen corresponding path program 5 times [2024-10-12 00:22:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948309768] [2024-10-12 00:22:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948309768] [2024-10-12 00:22:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948309768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474577032] [2024-10-12 00:22:23,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:22:23,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:23,854 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:23,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-12 00:22:23,931 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-10-12 00:22:23,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:23,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:22:23,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:22:24,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-12 00:22:24,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:24,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2024-10-12 00:22:24,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:24,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:24,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:24,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:24,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:24,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:24,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:24,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:24,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-12 00:22:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:24,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:24,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-12 00:22:24,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:24,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2024-10-12 00:22:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:22:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474577032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:24,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 31 [2024-10-12 00:22:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769602399] [2024-10-12 00:22:24,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:24,932 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2024-10-12 00:22:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056717150] [2024-10-12 00:22:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:24,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:24,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 00:22:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2024-10-12 00:22:25,033 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 11 Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:25,364 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-10-12 00:22:25,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2024-10-12 00:22:25,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:25,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 34 transitions. [2024-10-12 00:22:25,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:22:25,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:22:25,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-10-12 00:22:25,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:25,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-12 00:22:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-10-12 00:22:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-12 00:22:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-12 00:22:25,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-12 00:22:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 00:22:25,374 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-12 00:22:25,374 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:22:25,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2024-10-12 00:22:25,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:25,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:25,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:25,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:25,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:25,375 INFO L745 eck$LassoCheckResult]: Stem: 1616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1618#L367 assume !(main_~length~0#1 < 1); 1608#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1609#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1619#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1610#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1611#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1612#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1613#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1632#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1631#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1630#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1629#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1628#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1627#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1626#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1625#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1624#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1623#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1622#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1620#L375-4 main_~j~0#1 := 1; 1621#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1615#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1606#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1607#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1633#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1614#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1604#L380-2 [2024-10-12 00:22:25,376 INFO L747 eck$LassoCheckResult]: Loop: 1604#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1605#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1604#L380-2 [2024-10-12 00:22:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash -93884209, now seen corresponding path program 6 times [2024-10-12 00:22:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324545341] [2024-10-12 00:22:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:26,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324545341] [2024-10-12 00:22:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324545341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155511073] [2024-10-12 00:22:26,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:22:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:26,303 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:26,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-12 00:22:26,409 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-10-12 00:22:26,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:26,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 00:22:26,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:26,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:22:26,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-12 00:22:26,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:26,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:26,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:26,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:26,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:26,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:27,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-12 00:22:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:27,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:28,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-12 00:22:28,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:28,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2024-10-12 00:22:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 00:22:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155511073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:28,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 45 [2024-10-12 00:22:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370409254] [2024-10-12 00:22:28,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:28,117 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:28,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:28,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 9 times [2024-10-12 00:22:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:28,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044059550] [2024-10-12 00:22:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:28,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:28,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:28,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-12 00:22:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2024-10-12 00:22:28,218 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 6 Second operand has 46 states, 45 states have (on average 1.6) internal successors, (72), 46 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:29,025 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-10-12 00:22:29,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2024-10-12 00:22:29,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:29,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 36 transitions. [2024-10-12 00:22:29,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:22:29,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:22:29,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2024-10-12 00:22:29,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:29,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-10-12 00:22:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2024-10-12 00:22:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-12 00:22:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-10-12 00:22:29,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-12 00:22:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 00:22:29,033 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-12 00:22:29,033 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:22:29,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2024-10-12 00:22:29,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:29,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:29,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:29,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:29,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:29,034 INFO L745 eck$LassoCheckResult]: Stem: 1922#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1923#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1924#L367 assume !(main_~length~0#1 < 1); 1917#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1918#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1925#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1913#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1914#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1915#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1916#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1937#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1936#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1935#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1934#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1933#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1932#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1931#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1930#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1929#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 1928#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1927#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1926#L375-4 main_~j~0#1 := 1; 1909#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1910#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1940#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1921#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1911#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1912#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1938#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1919#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1920#L380-2 [2024-10-12 00:22:29,035 INFO L747 eck$LassoCheckResult]: Loop: 1920#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1939#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1920#L380-2 [2024-10-12 00:22:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash -28412078, now seen corresponding path program 7 times [2024-10-12 00:22:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534404995] [2024-10-12 00:22:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534404995] [2024-10-12 00:22:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534404995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662245236] [2024-10-12 00:22:29,905 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 00:22:29,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:29,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:29,908 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:29,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-12 00:22:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:29,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:22:29,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:30,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-12 00:22:30,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:22:30,054 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-12 00:22:30,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2024-10-12 00:22:30,113 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-10-12 00:22:30,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2024-10-12 00:22:30,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:30,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2024-10-12 00:22:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:30,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:30,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-12 00:22:30,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:30,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 187 [2024-10-12 00:22:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:22:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662245236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:30,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 26 [2024-10-12 00:22:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668972845] [2024-10-12 00:22:30,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:30,735 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 10 times [2024-10-12 00:22:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225597243] [2024-10-12 00:22:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:30,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:30,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:30,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 00:22:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-10-12 00:22:30,815 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 6 Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:31,129 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-12 00:22:31,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2024-10-12 00:22:31,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:31,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2024-10-12 00:22:31,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:22:31,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:22:31,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2024-10-12 00:22:31,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:31,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-12 00:22:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2024-10-12 00:22:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-12 00:22:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-12 00:22:31,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-12 00:22:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 00:22:31,134 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-12 00:22:31,134 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:22:31,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2024-10-12 00:22:31,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:31,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:31,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:31,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:31,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:31,136 INFO L745 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2200#L367 assume !(main_~length~0#1 < 1); 2189#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2190#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2201#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2191#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2192#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2193#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2194#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2213#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2212#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2211#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2210#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2209#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2208#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2207#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2206#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2205#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2204#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2203#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2202#L375-4 main_~j~0#1 := 1; 2185#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2186#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2187#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2188#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2197#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2218#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2217#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2216#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2215#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2195#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2196#L380-2 [2024-10-12 00:22:31,136 INFO L747 eck$LassoCheckResult]: Loop: 2196#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2214#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2196#L380-2 [2024-10-12 00:22:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1534203627, now seen corresponding path program 8 times [2024-10-12 00:22:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41133922] [2024-10-12 00:22:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41133922] [2024-10-12 00:22:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41133922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984303186] [2024-10-12 00:22:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:22:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:31,844 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:31,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-10-12 00:22:31,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:22:31,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:31,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 00:22:31,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:32,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:22:32,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-12 00:22:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:32,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:22:32,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:32,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-10-12 00:22:32,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:32,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-12 00:22:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:32,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:33,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-12 00:22:33,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:22:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 187 [2024-10-12 00:22:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984303186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:33,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 39 [2024-10-12 00:22:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111143103] [2024-10-12 00:22:33,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:33,187 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:33,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 11 times [2024-10-12 00:22:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901729789] [2024-10-12 00:22:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:33,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:33,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 00:22:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 00:22:33,282 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:33,842 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-12 00:22:33,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2024-10-12 00:22:33,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:33,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 40 transitions. [2024-10-12 00:22:33,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:22:33,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:22:33,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 40 transitions. [2024-10-12 00:22:33,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:33,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-10-12 00:22:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 40 transitions. [2024-10-12 00:22:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-12 00:22:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-12 00:22:33,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-12 00:22:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 00:22:33,851 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-12 00:22:33,851 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:22:33,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2024-10-12 00:22:33,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:22:33,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:33,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:33,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:33,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:33,852 INFO L745 eck$LassoCheckResult]: Stem: 2503#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2505#L367 assume !(main_~length~0#1 < 1); 2494#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2495#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2506#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2496#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2497#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2498#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2499#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2518#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2517#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2516#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2515#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2514#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2513#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2512#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2511#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2510#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1; 2509#L375-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2508#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2507#L375-4 main_~j~0#1 := 1; 2490#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2491#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2492#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2493#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2502#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2525#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2524#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2523#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2522#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2521#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2520#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2500#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2501#L380-2 [2024-10-12 00:22:33,852 INFO L747 eck$LassoCheckResult]: Loop: 2501#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2519#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2501#L380-2 [2024-10-12 00:22:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1195903464, now seen corresponding path program 9 times [2024-10-12 00:22:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:33,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427468515] [2024-10-12 00:22:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427468515] [2024-10-12 00:22:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427468515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617783986] [2024-10-12 00:22:34,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:22:34,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:34,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:34,747 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:34,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-10-12 00:22:34,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-12 00:22:34,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:34,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:22:34,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:35,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-12 00:22:35,229 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-10-12 00:22:35,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-10-12 00:22:36,232 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-10-12 00:22:36,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2024-10-12 00:22:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:36,238 INFO L311 TraceCheckSpWp]: Computing backward predicates...