./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array12_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array12_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:26:52,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:26:52,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:26:52,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:26:52,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:26:52,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:26:52,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:26:52,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:26:52,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:26:52,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:26:52,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:26:52,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:26:52,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:26:52,432 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:26:52,432 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:26:52,432 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:26:52,433 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:26:52,433 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:26:52,433 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:26:52,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:26:52,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:26:52,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:26:52,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:26:52,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:26:52,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:26:52,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:26:52,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:26:52,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:26:52,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:26:52,437 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:26:52,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:26:52,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:26:52,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:26:52,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:26:52,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:26:52,439 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:26:52,439 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2024-11-09 15:26:52,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:26:52,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:26:52,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:26:52,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:26:52,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:26:52,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array12_alloca.i [2024-11-09 15:26:54,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:26:54,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:26:54,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array12_alloca.i [2024-11-09 15:26:54,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f517a7d3/c4b78607c0274d7d8de6ec08e389ee86/FLAGb0d8ff2b6 [2024-11-09 15:26:54,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f517a7d3/c4b78607c0274d7d8de6ec08e389ee86 [2024-11-09 15:26:54,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:26:54,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:26:54,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:26:54,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:26:54,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:26:54,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb25d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54, skipping insertion in model container [2024-11-09 15:26:54,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:26:54,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:26:54,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:26:54,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:26:54,948 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:26:54,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54 WrapperNode [2024-11-09 15:26:54,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:26:54,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:26:54,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:26:54,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:26:54,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,986 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-09 15:26:54,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:26:54,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:26:54,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:26:54,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:26:54,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:54,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,016 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-09 15:26:55,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:26:55,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:26:55,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:26:55,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:26:55,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (1/1) ... [2024-11-09 15:26:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:55,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:55,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:26:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:26:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:26:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:26:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:26:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:26:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:26:55,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:26:55,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:26:55,333 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 15:26:55,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:26:55,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:26:55,349 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:26:55,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:55 BoogieIcfgContainer [2024-11-09 15:26:55,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:26:55,350 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:26:55,350 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:26:55,354 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:26:55,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:55,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:26:54" (1/3) ... [2024-11-09 15:26:55,356 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ab2e09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:26:55, skipping insertion in model container [2024-11-09 15:26:55,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:55,358 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:54" (2/3) ... [2024-11-09 15:26:55,358 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ab2e09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:26:55, skipping insertion in model container [2024-11-09 15:26:55,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:26:55,358 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:55" (3/3) ... [2024-11-09 15:26:55,359 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2024-11-09 15:26:55,408 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:26:55,408 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:26:55,408 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:26:55,408 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:26:55,408 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:26:55,408 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:26:55,409 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:26:55,409 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:26:55,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-11-09 15:26:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:55,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:55,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:26:55,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:55,428 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:26:55,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-11-09 15:26:55,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:26:55,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:55,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:55,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:26:55,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:26:55,437 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true 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; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2024-11-09 15:26:55,437 INFO L747 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 4#L370-3true [2024-11-09 15:26:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-09 15:26:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400126923] [2024-11-09 15:26:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2024-11-09 15:26:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:55,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725849963] [2024-11-09 15:26:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:55,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2024-11-09 15:26:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113364001] [2024-11-09 15:26:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:55,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:56,004 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:26:56,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:26:56,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:26:56,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:26:56,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:26:56,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:26:56,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:26:56,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2024-11-09 15:26:56,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:26:56,006 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:26:56,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:26:56,454 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:26:56,457 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:26:56,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:26:56,462 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-11-09 15:26:56,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:56,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:56,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:56,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:56,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:56,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:56,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:56,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:56,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:26:56,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:26:56,494 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-11-09 15:26:56,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:56,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:26:56,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:56,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:56,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:56,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:26:56,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:26:56,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:56,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:26:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:26:56,549 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-11-09 15:26:56,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:56,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:56,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:56,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:56,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:56,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:56,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:56,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:26:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:26:56,600 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-11-09 15:26:56,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:56,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:56,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:56,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:56,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:56,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:56,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:26:56,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:26:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,665 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:26:56,668 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-11-09 15:26:56,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:26:56,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:26:56,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:26:56,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:26:56,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:26:56,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:26:56,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:26:56,736 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:26:56,737 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:26:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:26:56,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:56,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:26:56,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:26:56,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:26:56,760 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:26:56,760 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:26:56,761 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 + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:26:56,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:26:56,788 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:26:56,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:26:56,796 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:26:56,799 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-09 15:26:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:56,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:26:56,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:56,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:26:56,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:56,909 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-11-09 15:26:56,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) 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-11-09 15:26:56,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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). 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 28 states and 40 transitions. Complement of second has 6 states. [2024-11-09 15:26:56,957 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-11-09 15:26:56,961 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-11-09 15:26:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-09 15:26:56,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-09 15:26:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:56,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-09 15:26:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:56,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-09 15:26:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:26:56,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2024-11-09 15:26:56,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:56,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions. [2024-11-09 15:26:56,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:26:56,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:26:56,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-11-09 15:26:56,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:56,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:26:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-11-09 15:26:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:26:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-11-09 15:26:56,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:26:56,991 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:26:56,991 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:26:56,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-11-09 15:26:56,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:56,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:56,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:56,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:56,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:56,992 INFO L745 eck$LassoCheckResult]: Stem: 109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 110#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 111#L367 assume !(main_~length~0#1 < 1); 103#L367-2 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; 104#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 105#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 108#L370-4 main_~j~0#1 := 0; 107#L378-2 [2024-11-09 15:26:56,993 INFO L747 eck$LassoCheckResult]: Loop: 107#L378-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); 106#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 107#L378-2 [2024-11-09 15:26:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2024-11-09 15:26:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611064830] [2024-11-09 15:26:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:57,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611064830] [2024-11-09 15:26:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611064830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:26:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:26:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:26:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337132257] [2024-11-09 15:26:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:26:57,094 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:57,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2024-11-09 15:26:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:57,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772502414] [2024-11-09 15:26:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:26:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:26:57,171 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:57,198 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-11-09 15:26:57,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-11-09 15:26:57,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:57,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-11-09 15:26:57,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:26:57,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:26:57,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-11-09 15:26:57,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:57,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-09 15:26:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-11-09 15:26:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2024-11-09 15:26:57,202 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-11-09 15:26:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-11-09 15:26:57,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 15:26:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:26:57,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 15:26:57,205 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:26:57,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-11-09 15:26:57,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:57,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:57,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:57,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:57,206 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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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); 136#L367-2 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; 137#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 138#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 145#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 147#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 146#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 139#L370-4 main_~j~0#1 := 0; 140#L378-2 [2024-11-09 15:26:57,206 INFO L747 eck$LassoCheckResult]: Loop: 140#L378-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); 141#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 140#L378-2 [2024-11-09 15:26:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2024-11-09 15:26:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639711785] [2024-11-09 15:26:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:57,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2024-11-09 15:26:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935572539] [2024-11-09 15:26:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:57,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:57,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2024-11-09 15:26:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389259646] [2024-11-09 15:26:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389259646] [2024-11-09 15:26:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389259646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676839435] [2024-11-09 15:26:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:57,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:57,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 15:26:57,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:26:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:57,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:26:57,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:57,735 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-11-09 15:26:57,795 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 15 treesize of output 7 [2024-11-09 15:26:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:57,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:57,879 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 16 treesize of output 14 [2024-11-09 15:26:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2024-11-09 15:26:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676839435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:57,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-11-09 15:26:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899307088] [2024-11-09 15:26:57,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 15:26:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-09 15:26:57,950 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 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-11-09 15:26:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:58,069 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2024-11-09 15:26:58,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-11-09 15:26:58,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:26:58,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-11-09 15:26:58,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:26:58,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:26:58,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-09 15:26:58,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:58,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-09 15:26:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-09 15:26:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-09 15:26:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2024-11-09 15:26:58,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-09 15:26:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:26:58,077 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-09 15:26:58,078 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:26:58,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2024-11-09 15:26:58,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:58,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:58,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:58,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:58,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:58,082 INFO L745 eck$LassoCheckResult]: Stem: 267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 268#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 269#L367 assume !(main_~length~0#1 < 1); 261#L367-2 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; 262#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 263#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 270#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 274#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 271#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 272#L370-4 main_~j~0#1 := 0; 275#L378-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); 266#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 265#L378-2 [2024-11-09 15:26:58,082 INFO L747 eck$LassoCheckResult]: Loop: 265#L378-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); 278#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 265#L378-2 [2024-11-09 15:26:58,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2024-11-09 15:26:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600042928] [2024-11-09 15:26:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2024-11-09 15:26:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419028674] [2024-11-09 15:26:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:58,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2024-11-09 15:26:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700253705] [2024-11-09 15:26:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700253705] [2024-11-09 15:26:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700253705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276536456] [2024-11-09 15:26:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:58,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:58,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 15:26:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:58,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:26:58,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:58,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276536456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:58,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 15:26:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462681802] [2024-11-09 15:26:58,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:26:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:26:58,394 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-09 15:26:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:58,483 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-09 15:26:58,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2024-11-09 15:26:58,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:26:58,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2024-11-09 15:26:58,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:58,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:58,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-09 15:26:58,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:58,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 15:26:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-09 15:26:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-11-09 15:26:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 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-11-09 15:26:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-09 15:26:58,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-09 15:26:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:26:58,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-09 15:26:58,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:26:58,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2024-11-09 15:26:58,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:26:58,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:58,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:58,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:58,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:58,492 INFO L745 eck$LassoCheckResult]: Stem: 430#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 431#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 432#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 423#L367-2 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; 424#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 425#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 455#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 453#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 454#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L372 assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 450#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 447#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 426#L370-4 main_~j~0#1 := 0; 427#L378-2 [2024-11-09 15:26:58,492 INFO L747 eck$LassoCheckResult]: Loop: 427#L378-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); 439#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 427#L378-2 [2024-11-09 15:26:58,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2024-11-09 15:26:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85933458] [2024-11-09 15:26:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:58,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:58,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85933458] [2024-11-09 15:26:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85933458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944475226] [2024-11-09 15:26:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:58,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:58,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 15:26:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:58,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:26:58,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:58,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:26:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944475226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:26:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:26:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 15:26:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63313387] [2024-11-09 15:26:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:26:58,648 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:26:58,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2024-11-09 15:26:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516865014] [2024-11-09 15:26:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:26:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:26:58,704 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:58,722 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-11-09 15:26:58,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2024-11-09 15:26:58,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:58,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2024-11-09 15:26:58,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:26:58,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:26:58,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-09 15:26:58,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:58,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-09 15:26:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-09 15:26:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 15:26:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:26:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-09 15:26:58,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-09 15:26:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:26:58,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-09 15:26:58,728 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:26:58,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-09 15:26:58,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:58,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:58,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:58,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:58,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:58,729 INFO L745 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 537#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 538#L367 assume !(main_~length~0#1 < 1); 530#L367-2 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; 531#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 532#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 539#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 542#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 540#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 541#L372 assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 549#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 546#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 533#L370-4 main_~j~0#1 := 0; 534#L378-2 [2024-11-09 15:26:58,729 INFO L747 eck$LassoCheckResult]: Loop: 534#L378-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); 543#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 534#L378-2 [2024-11-09 15:26:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2024-11-09 15:26:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215153130] [2024-11-09 15:26:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2024-11-09 15:26:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172573816] [2024-11-09 15:26:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:58,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:58,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2024-11-09 15:26:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:58,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76903152] [2024-11-09 15:26:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:58,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:26:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76903152] [2024-11-09 15:26:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76903152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:26:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830276777] [2024-11-09 15:26:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:26:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:26:59,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:26:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 15:26:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:26:59,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:26:59,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:26:59,111 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-11-09 15:26:59,163 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 15:26:59,163 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 31 treesize of output 11 [2024-11-09 15:26:59,182 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 15:26:59,183 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 23 treesize of output 22 [2024-11-09 15:26:59,299 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 15:26:59,299 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 26 treesize of output 10 [2024-11-09 15:26:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:26:59,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:26:59,430 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 16 treesize of output 14 [2024-11-09 15:26:59,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2024-11-09 15:26:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:26:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830276777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:26:59,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:26:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2024-11-09 15:26:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243061347] [2024-11-09 15:26:59,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:26:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:26:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 15:26:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-09 15:26:59,494 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 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-11-09 15:26:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:26:59,958 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-09 15:26:59,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-11-09 15:26:59,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:26:59,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 15:26:59,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:26:59,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:26:59,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-09 15:26:59,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:26:59,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 15:26:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-09 15:26:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2024-11-09 15:26:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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-11-09 15:26:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-09 15:26:59,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-09 15:26:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 15:26:59,963 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-09 15:26:59,963 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:26:59,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-09 15:26:59,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:26:59,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:26:59,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:26:59,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:26:59,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:26:59,964 INFO L745 eck$LassoCheckResult]: Stem: 711#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 712#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 713#L367 assume !(main_~length~0#1 < 1); 704#L367-2 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; 705#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 706#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 714#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 719#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 715#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 716#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 717#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 718#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 707#L370-4 main_~j~0#1 := 0; 708#L378-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); 709#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 710#L378-2 [2024-11-09 15:26:59,964 INFO L747 eck$LassoCheckResult]: Loop: 710#L378-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); 720#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 710#L378-2 [2024-11-09 15:26:59,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2024-11-09 15:26:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671759138] [2024-11-09 15:26:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:59,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:59,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2024-11-09 15:26:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042138974] [2024-11-09 15:26:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:59,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:26:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:26:59,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:26:59,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:26:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2024-11-09 15:26:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:26:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46517249] [2024-11-09 15:26:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:26:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:26:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46517249] [2024-11-09 15:27:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46517249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901606198] [2024-11-09 15:27:00,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:27:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:00,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:00,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 15:27:00,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:27:00,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:00,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:27:00,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:00,261 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-11-09 15:27:00,359 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 15 treesize of output 7 [2024-11-09 15:27:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:00,431 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 18 treesize of output 16 [2024-11-09 15:27:00,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 15:27:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901606198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:00,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2024-11-09 15:27:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045914621] [2024-11-09 15:27:00,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 15:27:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-09 15:27:00,486 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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-11-09 15:27:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:00,644 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-09 15:27:00,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-11-09 15:27:00,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:27:00,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 15:27:00,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:27:00,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:27:00,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-09 15:27:00,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:00,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:27:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-09 15:27:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-11-09 15:27:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-09 15:27:00,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 15:27:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:27:00,649 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 15:27:00,649 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:27:00,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2024-11-09 15:27:00,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:00,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:00,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:00,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:00,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:00,650 INFO L745 eck$LassoCheckResult]: Stem: 884#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 885#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 886#L367 assume !(main_~length~0#1 < 1); 878#L367-2 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; 879#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 880#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 887#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 895#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 888#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 889#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 890#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 892#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 893#L370-4 main_~j~0#1 := 0; 898#L378-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); 883#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 882#L378-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); 891#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 897#L378-2 [2024-11-09 15:27:00,650 INFO L747 eck$LassoCheckResult]: Loop: 897#L378-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); 896#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 897#L378-2 [2024-11-09 15:27:00,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2024-11-09 15:27:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759379343] [2024-11-09 15:27:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:00,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:00,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:00,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2024-11-09 15:27:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596241879] [2024-11-09 15:27:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:00,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:00,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:00,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2024-11-09 15:27:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618670070] [2024-11-09 15:27:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618670070] [2024-11-09 15:27:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618670070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300667028] [2024-11-09 15:27:00,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:27:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:00,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:00,800 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:00,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 15:27:00,861 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 15:27:00,861 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:00,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:27:00,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300667028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:00,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 15:27:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959319472] [2024-11-09 15:27:00,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:27:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:27:01,024 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:01,084 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-09 15:27:01,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-11-09 15:27:01,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:01,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2024-11-09 15:27:01,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:27:01,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:27:01,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-09 15:27:01,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:01,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:27:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-09 15:27:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-09 15:27:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-11-09 15:27:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-09 15:27:01,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-09 15:27:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:27:01,088 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-09 15:27:01,088 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:27:01,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-11-09 15:27:01,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:01,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:01,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:01,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:01,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:01,090 INFO L745 eck$LassoCheckResult]: Stem: 1071#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1072#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 1073#L367 assume !(main_~length~0#1 < 1); 1064#L367-2 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; 1065#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1066#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1074#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1077#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1078#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1089#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1075#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1087#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1079#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1080#L370-4 main_~j~0#1 := 0; 1070#L378-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); 1086#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1085#L378-2 [2024-11-09 15:27:01,090 INFO L747 eck$LassoCheckResult]: Loop: 1085#L378-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); 1084#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1085#L378-2 [2024-11-09 15:27:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2024-11-09 15:27:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165807036] [2024-11-09 15:27:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:01,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:01,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2024-11-09 15:27:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528280977] [2024-11-09 15:27:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:01,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:01,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2024-11-09 15:27:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155673901] [2024-11-09 15:27:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155673901] [2024-11-09 15:27:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155673901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289028809] [2024-11-09 15:27:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:01,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:01,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:01,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 15:27:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:01,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:27:01,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:01,496 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-11-09 15:27:01,559 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 15:27:01,560 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 33 treesize of output 13 [2024-11-09 15:27:01,578 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-11-09 15:27:01,578 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 25 treesize of output 24 [2024-11-09 15:27:01,734 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 15:27:01,734 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 30 treesize of output 10 [2024-11-09 15:27:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:01,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:01,854 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 18 treesize of output 16 [2024-11-09 15:27:01,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 15:27:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:27:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289028809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:01,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:01,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 18 [2024-11-09 15:27:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824907958] [2024-11-09 15:27:01,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 15:27:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-09 15:27:01,919 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:02,296 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 15:27:02,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2024-11-09 15:27:02,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:27:02,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2024-11-09 15:27:02,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-09 15:27:02,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:27:02,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2024-11-09 15:27:02,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:02,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 15:27:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2024-11-09 15:27:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2024-11-09 15:27:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-09 15:27:02,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:27:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 15:27:02,302 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:27:02,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:27:02,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-09 15:27:02,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:02,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:02,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:02,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:02,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:02,303 INFO L745 eck$LassoCheckResult]: Stem: 1282#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1283#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 1284#L367 assume !(main_~length~0#1 < 1); 1275#L367-2 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; 1276#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1277#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1285#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1294#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1286#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1287#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1292#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1293#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1288#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1289#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1291#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1278#L370-4 main_~j~0#1 := 0; 1279#L378-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); 1280#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1281#L378-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); 1290#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1296#L378-2 [2024-11-09 15:27:02,303 INFO L747 eck$LassoCheckResult]: Loop: 1296#L378-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); 1295#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1296#L378-2 [2024-11-09 15:27:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2024-11-09 15:27:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:02,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211358686] [2024-11-09 15:27:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:02,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:02,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2024-11-09 15:27:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078013915] [2024-11-09 15:27:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:02,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:02,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:02,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2024-11-09 15:27:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394892042] [2024-11-09 15:27:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394892042] [2024-11-09 15:27:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394892042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663309992] [2024-11-09 15:27:02,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:27:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:02,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:02,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 15:27:02,600 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:27:02,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:02,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:27:02,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:02,622 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-11-09 15:27:02,691 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 19 treesize of output 7 [2024-11-09 15:27:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:02,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:02,801 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 18 treesize of output 16 [2024-11-09 15:27:02,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 15:27:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:02,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663309992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:02,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2024-11-09 15:27:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937216671] [2024-11-09 15:27:02,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:27:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:27:02,857 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:03,000 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-09 15:27:03,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2024-11-09 15:27:03,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:27:03,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2024-11-09 15:27:03,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-09 15:27:03,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-09 15:27:03,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-11-09 15:27:03,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:03,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-09 15:27:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-11-09 15:27:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-09 15:27:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 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-11-09 15:27:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 15:27:03,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:27:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:27:03,011 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:27:03,011 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:27:03,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2024-11-09 15:27:03,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:03,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:03,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:03,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:03,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:03,013 INFO L745 eck$LassoCheckResult]: Stem: 1489#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1490#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 1491#L367 assume !(main_~length~0#1 < 1); 1483#L367-2 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; 1484#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1485#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1492#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1500#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1501#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1502#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1503#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1493#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1494#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1496#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1497#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1498#L370-4 main_~j~0#1 := 0; 1508#L378-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); 1486#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1487#L378-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); 1495#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1507#L378-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); 1506#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1505#L378-2 [2024-11-09 15:27:03,013 INFO L747 eck$LassoCheckResult]: Loop: 1505#L378-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); 1504#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1505#L378-2 [2024-11-09 15:27:03,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2024-11-09 15:27:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758545833] [2024-11-09 15:27:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:03,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2024-11-09 15:27:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914983759] [2024-11-09 15:27:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:03,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2024-11-09 15:27:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361407551] [2024-11-09 15:27:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:03,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361407551] [2024-11-09 15:27:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361407551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182471817] [2024-11-09 15:27:03,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:27:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:03,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:03,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 15:27:03,241 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-09 15:27:03,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:03,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:27:03,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:03,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182471817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:03,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-09 15:27:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162899972] [2024-11-09 15:27:03,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:03,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:03,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:27:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:27:03,465 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:03,540 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-09 15:27:03,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-09 15:27:03,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:03,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2024-11-09 15:27:03,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:27:03,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-09 15:27:03,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2024-11-09 15:27:03,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:03,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-09 15:27:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2024-11-09 15:27:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-09 15:27:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 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-11-09 15:27:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-09 15:27:03,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 15:27:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:27:03,547 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 15:27:03,547 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:27:03,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-11-09 15:27:03,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:03,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:03,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:03,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:03,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:03,548 INFO L745 eck$LassoCheckResult]: Stem: 1720#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1721#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 1722#L367 assume !(main_~length~0#1 < 1); 1714#L367-2 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; 1715#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1716#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1723#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1744#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1724#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1725#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1726#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1728#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1743#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1742#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1741#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1739#L372 assume main_#t~mem208#1 < 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1731#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1729#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1717#L370-4 main_~j~0#1 := 0; 1718#L378-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); 1727#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1735#L378-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); 1734#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1733#L378-2 [2024-11-09 15:27:03,548 INFO L747 eck$LassoCheckResult]: Loop: 1733#L378-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); 1732#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1733#L378-2 [2024-11-09 15:27:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2024-11-09 15:27:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555435018] [2024-11-09 15:27:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2024-11-09 15:27:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478532254] [2024-11-09 15:27:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:03,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2024-11-09 15:27:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375479132] [2024-11-09 15:27:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375479132] [2024-11-09 15:27:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375479132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974604383] [2024-11-09 15:27:03,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:27:03,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:03,905 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 15:27:03,976 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:27:03,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:03,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 15:27:03,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:04,067 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-11-09 15:27:04,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 15:27:04,149 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 27 treesize of output 11 [2024-11-09 15:27:04,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 15:27:04,158 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 21 treesize of output 20 [2024-11-09 15:27:04,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 15:27:04,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:27:04,375 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 24 treesize of output 10 [2024-11-09 15:27:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:04,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:04,511 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 18 treesize of output 16 [2024-11-09 15:27:04,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 15:27:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:27:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974604383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:04,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:04,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 26 [2024-11-09 15:27:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864855026] [2024-11-09 15:27:04,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 15:27:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-11-09 15:27:04,566 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 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-11-09 15:27:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:04,937 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-09 15:27:04,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2024-11-09 15:27:04,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:27:04,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2024-11-09 15:27:04,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-09 15:27:04,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-09 15:27:04,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-11-09 15:27:04,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:04,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-09 15:27:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-11-09 15:27:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2024-11-09 15:27:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-11-09 15:27:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-09 15:27:04,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 15:27:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 15:27:04,947 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 15:27:04,947 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:27:04,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-11-09 15:27:04,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:04,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:04,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:04,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:04,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:04,948 INFO L745 eck$LassoCheckResult]: Stem: 1992#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1993#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 1994#L367 assume !(main_~length~0#1 < 1); 1985#L367-2 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; 1986#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1987#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1995#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2007#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1996#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1997#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2001#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2002#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2006#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2005#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2004#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1998#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 1999#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2003#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1990#L370-4 main_~j~0#1 := 0; 1991#L378-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); 1988#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1989#L378-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); 2000#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2011#L378-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); 2010#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2009#L378-2 [2024-11-09 15:27:04,948 INFO L747 eck$LassoCheckResult]: Loop: 2009#L378-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); 2008#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2009#L378-2 [2024-11-09 15:27:04,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 893969701, now seen corresponding path program 6 times [2024-11-09 15:27:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861280583] [2024-11-09 15:27:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:04,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:04,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2024-11-09 15:27:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869902880] [2024-11-09 15:27:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:04,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:05,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 111424808, now seen corresponding path program 6 times [2024-11-09 15:27:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565961515] [2024-11-09 15:27:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:27:05,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565961515] [2024-11-09 15:27:05,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565961515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:27:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817574371] [2024-11-09 15:27:05,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:27:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:27:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:05,248 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:27:05,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 15:27:05,322 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-09 15:27:05,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:27:05,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 15:27:05,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:05,408 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-11-09 15:27:05,722 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 15:27:05,722 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 23 treesize of output 10 [2024-11-09 15:27:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:05,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:27:06,126 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 20 treesize of output 18 [2024-11-09 15:27:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 20 [2024-11-09 15:27:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817574371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:27:06,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:27:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2024-11-09 15:27:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116681289] [2024-11-09 15:27:06,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:27:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:27:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 15:27:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 15:27:06,242 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:27:07,720 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-09 15:27:07,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-11-09 15:27:07,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:27:07,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2024-11-09 15:27:07,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-09 15:27:07,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:27:07,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-11-09 15:27:07,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:07,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-09 15:27:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-11-09 15:27:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2024-11-09 15:27:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-09 15:27:07,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:27:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 15:27:07,728 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:27:07,728 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:27:07,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-11-09 15:27:07,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:27:07,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:27:07,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:27:07,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:27:07,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:27:07,729 INFO L745 eck$LassoCheckResult]: Stem: 2299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2300#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~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;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; 2301#L367 assume !(main_~length~0#1 < 1); 2293#L367-2 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; 2294#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2295#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2302#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2313#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2303#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2304#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2305#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2306#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2312#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2311#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2310#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2308#L372 assume !(main_#t~mem208#1 < 0);havoc main_#t~mem208#1; 2309#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2307#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2296#L370-4 main_~j~0#1 := 0; 2297#L378-2 [2024-11-09 15:27:07,730 INFO L747 eck$LassoCheckResult]: Loop: 2297#L378-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); 2298#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2297#L378-2 [2024-11-09 15:27:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -49003114, now seen corresponding path program 2 times [2024-11-09 15:27:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740785056] [2024-11-09 15:27:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2024-11-09 15:27:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393171968] [2024-11-09 15:27:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 152649051, now seen corresponding path program 7 times [2024-11-09 15:27:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:27:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098361506] [2024-11-09 15:27:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:27:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:27:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:27:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:27:07,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:27:08,313 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:27:08,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:27:08,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:27:08,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:27:08,313 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:27:08,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:27:08,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:27:08,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration14_Lasso [2024-11-09 15:27:08,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:27:08,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:27:08,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:27:08,733 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:27:08,733 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:27:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,736 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:27:08,739 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-11-09 15:27:08,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:27:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,773 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:27:08,777 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-11-09 15:27:08,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,809 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:27:08,811 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-11-09 15:27:08,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:27:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,843 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:27:08,846 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-11-09 15:27:08,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:27:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,879 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:27:08,882 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-11-09 15:27:08,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:08,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,914 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:27:08,916 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-11-09 15:27:08,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:27:08,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,947 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:27:08,953 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-11-09 15:27:08,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:08,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:08,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:08,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:08,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:08,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:08,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:08,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:08,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:27:08,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:08,986 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:08,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:27:08,989 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-11-09 15:27:09,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:09,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:09,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:09,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:27:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,025 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:27:09,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-11-09 15:27:09,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:09,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:09,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:09,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:27:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,062 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:27:09,065 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-11-09 15:27:09,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:27:09,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:27:09,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:27:09,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,097 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:27:09,100 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-11-09 15:27:09,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,135 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:27:09,138 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-11-09 15:27:09,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,175 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:27:09,176 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-11-09 15:27:09,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,202 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:27:09,203 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-11-09 15:27:09,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,235 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:27:09,236 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-11-09 15:27:09,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:27:09,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,263 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:27:09,264 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-11-09 15:27:09,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:27:09,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:27:09,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:27:09,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:27:09,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:27:09,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:27:09,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:27:09,311 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:27:09,311 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:27:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:27:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:27:09,314 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:27:09,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:27:09,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:27:09,326 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:27:09,326 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:27:09,326 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-09 15:27:09,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:27:09,346 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:27:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:27:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:09,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:27:09,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:27:09,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:27:09,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:27:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:27:09,410 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-11-09 15:27:09,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:09,425 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 4 states. [2024-11-09 15:27:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:27:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:27:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:27:09,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-09 15:27:09,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:27:09,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:27:09,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:27:09,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-09 15:27:09,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:27:09,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2024-11-09 15:27:09,427 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:27:09,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-11-09 15:27:09,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:27:09,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:27:09,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:27:09,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:27:09,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:27:09,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:27:09,428 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:27:09,428 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:27:09,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:27:09,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:27:09,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:27:09,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:27:09 BoogieIcfgContainer [2024-11-09 15:27:09,435 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:27:09,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:27:09,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:27:09,436 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:27:09,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:55" (3/4) ... [2024-11-09 15:27:09,439 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:27:09,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:27:09,440 INFO L158 Benchmark]: Toolchain (without parser) took 14993.95ms. Allocated memory was 144.7MB in the beginning and 276.8MB in the end (delta: 132.1MB). Free memory was 68.1MB in the beginning and 113.5MB in the end (delta: -45.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2024-11-09 15:27:09,441 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 144.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:27:09,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.74ms. Allocated memory is still 144.7MB. Free memory was 67.8MB in the beginning and 112.4MB in the end (delta: -44.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-09 15:27:09,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:27:09,441 INFO L158 Benchmark]: Boogie Preprocessor took 40.65ms. Allocated memory is still 144.7MB. Free memory was 110.9MB in the beginning and 109.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:27:09,444 INFO L158 Benchmark]: RCFGBuilder took 321.29ms. Allocated memory is still 144.7MB. Free memory was 109.0MB in the beginning and 109.9MB in the end (delta: -907.3kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-09 15:27:09,445 INFO L158 Benchmark]: BuchiAutomizer took 14084.69ms. Allocated memory was 144.7MB in the beginning and 276.8MB in the end (delta: 132.1MB). Free memory was 109.9MB in the beginning and 113.5MB in the end (delta: -3.6MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2024-11-09 15:27:09,445 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 276.8MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:27:09,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59ms. Allocated memory is still 144.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.74ms. Allocated memory is still 144.7MB. Free memory was 67.8MB in the beginning and 112.4MB in the end (delta: -44.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.65ms. Allocated memory is still 144.7MB. Free memory was 110.9MB in the beginning and 109.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.29ms. Allocated memory is still 144.7MB. Free memory was 109.0MB in the beginning and 109.9MB in the end (delta: -907.3kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 14084.69ms. Allocated memory was 144.7MB in the beginning and 276.8MB in the end (delta: 132.1MB). Free memory was 109.9MB in the beginning and 113.5MB in the end (delta: -3.6MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 276.8MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~arr~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 10.2s. Construction of modules took 1.9s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 98 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 121 mSDtfsCounter, 1847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp58 div165 bol100 ite100 ukn100 eq146 hnf94 smp71 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:27:09,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-09 15:27:09,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:09,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:10,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 15:27:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:10,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 15:27:10,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:10,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 15:27:11,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 15:27:11,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:11,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:11,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:27:11,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE