./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array17_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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:40:42,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:40:42,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:40:42,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:40:42,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:40:42,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:40:43,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:40:43,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:40:43,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:40:43,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:40:43,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:40:43,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:40:43,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:40:43,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:40:43,026 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:40:43,026 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:40:43,026 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:40:43,027 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:40:43,027 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:40:43,027 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:40:43,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:40:43,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:40:43,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:40:43,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:40:43,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:40:43,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:40:43,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:40:43,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:40:43,030 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:40:43,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:40:43,031 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:40:43,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:40:43,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:40:43,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:40:43,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:40:43,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:40:43,033 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:40:43,033 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2024-11-10 22:40:43,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:40:43,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:40:43,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:40:43,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:40:43,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:40:43,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array17_alloca.i [2024-11-10 22:40:44,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:40:45,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:40:45,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2024-11-10 22:40:45,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dfba543/f84be5bc8cbd4aaeb93ad990176cc8e1/FLAG5a455f215 [2024-11-10 22:40:45,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dfba543/f84be5bc8cbd4aaeb93ad990176cc8e1 [2024-11-10 22:40:45,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:40:45,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:40:45,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:40:45,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:40:45,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:40:45,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cf4993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45, skipping insertion in model container [2024-11-10 22:40:45,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:40:45,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:40:45,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:40:45,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:40:45,871 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:40:45,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45 WrapperNode [2024-11-10 22:40:45,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:40:45,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:40:45,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:40:45,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:40:45,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,916 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-11-10 22:40:45,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:40:45,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:40:45,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:40:45,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:40:45,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,944 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-10 22:40:45,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:40:45,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:40:45,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:40:45,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:40:45,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (1/1) ... [2024-11-10 22:40:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:45,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:45,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:46,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:40:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:40:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:40:46,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:40:46,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:40:46,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:40:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:40:46,114 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:40:46,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:40:46,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: call ULTIMATE.dealloc(main_#t~malloc206#1.base, main_#t~malloc206#1.offset);havoc main_#t~malloc206#1.base, main_#t~malloc206#1.offset; [2024-11-10 22:40:46,251 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 22:40:46,253 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:40:46,266 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:40:46,267 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:40:46,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:40:46 BoogieIcfgContainer [2024-11-10 22:40:46,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:40:46,268 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:40:46,270 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:40:46,274 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:40:46,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:40:46,275 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:40:45" (1/3) ... [2024-11-10 22:40:46,276 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3918f792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:40:46, skipping insertion in model container [2024-11-10 22:40:46,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:40:46,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:45" (2/3) ... [2024-11-10 22:40:46,276 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3918f792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:40:46, skipping insertion in model container [2024-11-10 22:40:46,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:40:46,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:40:46" (3/3) ... [2024-11-10 22:40:46,280 INFO L332 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2024-11-10 22:40:46,327 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:40:46,328 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:40:46,328 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:40:46,328 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:40:46,328 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:40:46,329 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:40:46,329 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:40:46,329 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:40:46,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:46,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-10 22:40:46,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:46,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:46,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:40:46,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:40:46,360 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:40:46,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:46,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-10 22:40:46,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:46,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:46,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 22:40:46,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:40:46,369 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 14#L367true assume !(main_~length~0#1 < 1); 8#L368true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 11#L371-1true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 17#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 13#L375true [2024-11-10 22:40:46,370 INFO L747 eck$LassoCheckResult]: Loop: 13#L375true assume true; 15#L375-1true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 13#L375true [2024-11-10 22:40:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1981104313, now seen corresponding path program 1 times [2024-11-10 22:40:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:46,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141349221] [2024-11-10 22:40:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2024-11-10 22:40:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841217124] [2024-11-10 22:40:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:46,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1170733208, now seen corresponding path program 1 times [2024-11-10 22:40:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712868246] [2024-11-10 22:40:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:46,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:46,993 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:40:46,994 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:40:46,994 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:40:46,995 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:40:46,995 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:40:46,995 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:46,995 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:40:46,995 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:40:46,995 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2024-11-10 22:40:46,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:40:46,996 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:40:47,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:47,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:40:47,541 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:40:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,545 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-10 22:40:47,547 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-10 22:40:47,551 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-10 22:40:47,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,591 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-10 22:40:47,592 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-10 22:40:47,593 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-10 22:40:47,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:47,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,625 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-10 22:40:47,626 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-10 22:40:47,627 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-10 22:40:47,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,658 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-10 22:40:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,661 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-10 22:40:47,663 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-10 22:40:47,664 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-10 22:40:47,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:47,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,696 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-10 22:40:47,697 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-10 22:40:47,699 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-10 22:40:47,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,727 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-10 22:40:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,730 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-10 22:40:47,731 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-10 22:40:47,733 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-10 22:40:47,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,767 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-10 22:40:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,769 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:40:47,771 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-10 22:40:47,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:40:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:40:47,805 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-10 22:40:47,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:40:47,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:40:47,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-10 22:40:47,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:47,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:47,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:47,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 22:40:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:40:47,881 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-10 22:40:47,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:47,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:47,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 22:40:47,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:40:47,923 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-10 22:40:47,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:47,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:47,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:47,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:47,962 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:47,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:40:47,965 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-10 22:40:47,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:47,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:47,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:47,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:47,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:47,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:47,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:48,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:40:48,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:48,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:48,002 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:48,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:40:48,005 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-10 22:40:48,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:48,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:48,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:48,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:48,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:48,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:48,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:40:48,070 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-10 22:40:48,070 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-10 22:40:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:48,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:48,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:48,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:40:48,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:40:48,093 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:40:48,093 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:40:48,094 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:40:48,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 22:40:48,122 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-10 22:40:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:48,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:40:48,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:48,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:40:48,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:48,224 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:40:48,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-10 22:40:48,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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 29 states and 40 transitions. Complement of second has 6 states. [2024-11-10 22:40:48,257 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-10 22:40:48,261 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-10 22:40:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-10 22:40:48,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-10 22:40:48,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:48,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-10 22:40:48,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:48,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-10 22:40:48,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:48,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2024-11-10 22:40:48,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:48,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 14 states and 18 transitions. [2024-11-10 22:40:48,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-10 22:40:48,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:40:48,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2024-11-10 22:40:48,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:48,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-10 22:40:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2024-11-10 22:40:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 22:40:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-11-10 22:40:48,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-10 22:40:48,295 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-10 22:40:48,295 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:40:48,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-11-10 22:40:48,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:48,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:48,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:48,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:48,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:48,297 INFO L745 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 107#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 108#L367 assume !(main_~length~0#1 < 1); 117#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 110#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 111#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 113#L375 assume true; 115#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 112#L378 main_~j~0#1 := 1; 109#L379 [2024-11-10 22:40:48,297 INFO L747 eck$LassoCheckResult]: Loop: 109#L379 assume true; 104#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 105#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 109#L379 [2024-11-10 22:40:48,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1932991030, now seen corresponding path program 1 times [2024-11-10 22:40:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462098822] [2024-11-10 22:40:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:40:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462098822] [2024-11-10 22:40:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462098822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:40:48,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:40:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:40:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964920519] [2024-11-10 22:40:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:40:48,416 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:40:48,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 1 times [2024-11-10 22:40:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279960600] [2024-11-10 22:40:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:40:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:40:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:40:48,504 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:40:48,529 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2024-11-10 22:40:48,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2024-11-10 22:40:48,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:48,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 18 transitions. [2024-11-10 22:40:48,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:40:48,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:40:48,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2024-11-10 22:40:48,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:48,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-10 22:40:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2024-11-10 22:40:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-10 22:40:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-11-10 22:40:48,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-10 22:40:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:40:48,537 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-10 22:40:48,537 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:40:48,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2024-11-10 22:40:48,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:48,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:48,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:48,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:48,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:48,539 INFO L745 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 144#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 145#L367 assume !(main_~length~0#1 < 1); 154#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 147#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 148#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 150#L375 assume true; 151#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 152#L375 assume true; 153#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 149#L378 main_~j~0#1 := 1; 146#L379 [2024-11-10 22:40:48,539 INFO L747 eck$LassoCheckResult]: Loop: 146#L379 assume true; 141#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 142#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 146#L379 [2024-11-10 22:40:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2116394505, now seen corresponding path program 1 times [2024-11-10 22:40:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977995541] [2024-11-10 22:40:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:48,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 2 times [2024-11-10 22:40:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332980903] [2024-11-10 22:40:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:48,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 611216718, now seen corresponding path program 1 times [2024-11-10 22:40:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071534450] [2024-11-10 22:40:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:40:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071534450] [2024-11-10 22:40:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071534450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:40:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294607917] [2024-11-10 22:40:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:48,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:40:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:48,718 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-10 22:40:48,719 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-10 22:40:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:48,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:40:48,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:48,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:40:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294607917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:40:48,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:40:48,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-11-10 22:40:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235945193] [2024-11-10 22:40:48,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:40:48,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:40:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:40:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:40:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:40:48,993 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:40:49,044 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-10 22:40:49,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2024-11-10 22:40:49,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:49,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 17 states and 19 transitions. [2024-11-10 22:40:49,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:40:49,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:40:49,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2024-11-10 22:40:49,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:49,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-10 22:40:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2024-11-10 22:40:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-10 22:40:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-10 22:40:49,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-10 22:40:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:40:49,053 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-10 22:40:49,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:40:49,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-10 22:40:49,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:49,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:49,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:49,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:49,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:49,055 INFO L745 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 281#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 282#L367 assume !(main_~length~0#1 < 1); 291#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 285#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 286#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 287#L375 assume true; 288#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 289#L375 assume true; 290#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 293#L375 assume true; 292#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 284#L378 main_~j~0#1 := 1; 283#L379 [2024-11-10 22:40:49,055 INFO L747 eck$LassoCheckResult]: Loop: 283#L379 assume true; 278#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 279#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 283#L379 [2024-11-10 22:40:49,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1959443832, now seen corresponding path program 2 times [2024-11-10 22:40:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935497008] [2024-11-10 22:40:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 3 times [2024-11-10 22:40:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949947074] [2024-11-10 22:40:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 890689069, now seen corresponding path program 2 times [2024-11-10 22:40:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293213468] [2024-11-10 22:40:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:49,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:49,434 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:40:49,435 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:40:49,435 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:40:49,435 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:40:49,435 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:40:49,435 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,435 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:40:49,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:40:49,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2024-11-10 22:40:49,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:40:49,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:40:49,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:49,811 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:40:49,811 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:40:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:49,814 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:49,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:40:49,818 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-10 22:40:49,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:49,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:49,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:49,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:49,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:49,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:49,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:49,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:49,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:49,844 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:40:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:40:49,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-10 22:40:49,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:49,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:49,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:49,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:49,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:49,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:49,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:49,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:49,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:49,871 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-10 22:40:49,872 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-10 22:40:49,872 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-10 22:40:49,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:49,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:49,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:49,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:49,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:49,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:49,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:49,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:49,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:49,908 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-10 22:40:49,910 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-10 22:40:49,910 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-10 22:40:49,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:49,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:49,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:49,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:49,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:49,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:49,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:40:49,969 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-10 22:40:49,969 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-10 22:40:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:49,972 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-10 22:40:49,973 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-10 22:40:49,974 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:40:49,991 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-10 22:40:49,991 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:40:49,991 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 3*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 16*ULTIMATE.start_main_~j~0#1 Supporting invariants [-1*ULTIMATE.start_main_~length~0#1 + 2 >= 0] [2024-11-10 22:40:50,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-10 22:40:50,021 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:40:50,024 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:40:50,024 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:40:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:50,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:40:50,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:50,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:40:50,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:50,207 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-10 22:40:50,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10 22:40:50,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 29 states and 34 transitions. Complement of second has 12 states. [2024-11-10 22:40:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:40:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10 22:40:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2024-11-10 22:40:50,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2024-11-10 22:40:50,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:50,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 16 letters. Loop has 3 letters. [2024-11-10 22:40:50,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:50,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 13 letters. Loop has 6 letters. [2024-11-10 22:40:50,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:50,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2024-11-10 22:40:50,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:50,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2024-11-10 22:40:50,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:40:50,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-10 22:40:50,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2024-11-10 22:40:50,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:50,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-10 22:40:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2024-11-10 22:40:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-10 22:40:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 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-10 22:40:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-10 22:40:50,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-10 22:40:50,304 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-10 22:40:50,304 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:40:50,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2024-11-10 22:40:50,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:50,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:50,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:50,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:50,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:50,308 INFO L745 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 443#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 444#L367 assume !(main_~length~0#1 < 1); 455#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 448#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 449#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 451#L375 assume true; 452#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 453#L375 assume true; 454#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 460#L375 assume true; 461#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 462#L375 assume true; 456#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 450#L378 main_~j~0#1 := 1; 445#L379 [2024-11-10 22:40:50,308 INFO L747 eck$LassoCheckResult]: Loop: 445#L379 assume true; 446#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 463#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 445#L379 [2024-11-10 22:40:50,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1829911737, now seen corresponding path program 3 times [2024-11-10 22:40:50,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:50,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317139686] [2024-11-10 22:40:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:50,352 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-10 22:40:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 4 times [2024-11-10 22:40:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009108699] [2024-11-10 22:40:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1119321268, now seen corresponding path program 3 times [2024-11-10 22:40:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113213840] [2024-11-10 22:40:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:50,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:50,834 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:40:50,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:40:50,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:40:50,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:40:50,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:40:50,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:50,835 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:40:50,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:40:50,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration5_Lasso [2024-11-10 22:40:50,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:40:50,835 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:40:50,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:50,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:40:51,305 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:40:51,306 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:40:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:51,308 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-10 22:40:51,310 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-10 22:40:51,311 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-10 22:40:51,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:51,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:40:51,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:51,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:51,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:51,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:40:51,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:40:51,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:40:51,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-10 22:40:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:51,337 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-10 22:40:51,338 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-10 22:40:51,339 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-10 22:40:51,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:40:51,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:40:51,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:40:51,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:40:51,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:40:51,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:40:51,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:40:51,389 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-10 22:40:51,389 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-10 22:40:51,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:40:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:51,391 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-10 22:40:51,391 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-10 22:40:51,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:40:51,403 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:40:51,403 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:40:51,403 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-10 22:40:51,413 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-10 22:40:51,424 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-10 22:40:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:51,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:40:51,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:51,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:40:51,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:51,502 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-10 22:40:51,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10 22:40:51,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Result 36 states and 45 transitions. Complement of second has 7 states. [2024-11-10 22:40:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:40:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10 22:40:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-10 22:40:51,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:40:51,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:51,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-10 22:40:51,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:51,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-10 22:40:51,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:40:51,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2024-11-10 22:40:51,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:51,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 39 transitions. [2024-11-10 22:40:51,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:40:51,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-10 22:40:51,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2024-11-10 22:40:51,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:51,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-10 22:40:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2024-11-10 22:40:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2024-11-10 22:40:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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-10 22:40:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-10 22:40:51,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-10 22:40:51,536 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-10 22:40:51,536 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:40:51,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-11-10 22:40:51,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:51,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:51,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:51,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:51,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:51,538 INFO L745 eck$LassoCheckResult]: Stem: 601#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 602#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 603#L367 assume !(main_~length~0#1 < 1); 615#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 609#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 610#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 611#L375 assume true; 612#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 613#L375 assume true; 614#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 617#L375 assume true; 616#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 607#L378 main_~j~0#1 := 1; 608#L379 assume true; 597#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 598#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 604#L379 [2024-11-10 22:40:51,538 INFO L747 eck$LassoCheckResult]: Loop: 604#L379 assume true; 605#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 618#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 604#L379 [2024-11-10 22:40:51,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 890689070, now seen corresponding path program 1 times [2024-11-10 22:40:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221113283] [2024-11-10 22:40:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:51,683 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-10 22:40:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:40:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221113283] [2024-11-10 22:40:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221113283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:40:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125496313] [2024-11-10 22:40:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:52,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:40:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:52,006 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:40:52,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-10 22:40:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:52,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:40:52,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:52,100 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 13 treesize of output 9 [2024-11-10 22:40:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-10 22:40:52,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:40:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-10 22:40:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:52,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:40:56,584 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 51 treesize of output 47 [2024-11-10 22:40:56,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:40:56,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 774 treesize of output 678 [2024-11-10 22:40:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125496313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:40:56,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:40:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-10 22:40:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174220289] [2024-11-10 22:40:56,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:40:56,634 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:40:56,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 5 times [2024-11-10 22:40:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037764956] [2024-11-10 22:40:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:56,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:56,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:56,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:40:56,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 22:40:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-10 22:40:56,734 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:40:56,891 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-10 22:40:56,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2024-11-10 22:40:56,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:56,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2024-11-10 22:40:56,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:40:56,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 22:40:56,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2024-11-10 22:40:56,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:56,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 22:40:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2024-11-10 22:40:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-10 22:40:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-10 22:40:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-10 22:40:56,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-10 22:40:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 22:40:56,896 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-10 22:40:56,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:40:56,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-11-10 22:40:56,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:56,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:56,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:56,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:56,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:56,898 INFO L745 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 763#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 764#L367 assume !(main_~length~0#1 < 1); 777#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 768#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 769#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 771#L375 assume true; 772#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 773#L375 assume true; 774#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 779#L375 assume true; 778#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 770#L378 main_~j~0#1 := 1; 765#L379 assume true; 760#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 761#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 766#L379 assume true; 767#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 775#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 776#L379 [2024-11-10 22:40:56,898 INFO L747 eck$LassoCheckResult]: Loop: 776#L379 assume true; 758#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 759#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 776#L379 [2024-11-10 22:40:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 210109785, now seen corresponding path program 1 times [2024-11-10 22:40:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146723523] [2024-11-10 22:40:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:40:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146723523] [2024-11-10 22:40:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146723523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:40:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571515262] [2024-11-10 22:40:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:56,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:40:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:56,993 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:40:57,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-10 22:40:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:57,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:40:57,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:57,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:40:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571515262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:40:57,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:40:57,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-10 22:40:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251265466] [2024-11-10 22:40:57,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:40:57,177 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:40:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 6 times [2024-11-10 22:40:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187203780] [2024-11-10 22:40:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:57,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:57,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:40:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 22:40:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-10 22:40:57,269 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:40:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:40:57,315 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-10 22:40:57,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2024-11-10 22:40:57,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:57,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 28 transitions. [2024-11-10 22:40:57,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:40:57,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 22:40:57,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2024-11-10 22:40:57,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:40:57,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 22:40:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2024-11-10 22:40:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-10 22:40:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 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-10 22:40:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-10 22:40:57,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-10 22:40:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:40:57,320 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-10 22:40:57,320 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:40:57,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2024-11-10 22:40:57,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:40:57,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:40:57,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:40:57,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:40:57,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:40:57,321 INFO L745 eck$LassoCheckResult]: Stem: 940#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 941#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 942#L367 assume !(main_~length~0#1 < 1); 954#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 946#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 947#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 950#L375 assume true; 951#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 952#L375 assume true; 953#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 956#L375 assume true; 958#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 957#L375 assume true; 955#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 948#L378 main_~j~0#1 := 1; 949#L379 assume true; 938#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 939#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 945#L379 assume true; 936#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 937#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 943#L379 [2024-11-10 22:40:57,321 INFO L747 eck$LassoCheckResult]: Loop: 943#L379 assume true; 944#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 959#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 943#L379 [2024-11-10 22:40:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash 426201050, now seen corresponding path program 2 times [2024-11-10 22:40:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499708931] [2024-11-10 22:40:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:40:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:40:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499708931] [2024-11-10 22:40:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499708931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:40:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969940586] [2024-11-10 22:40:57,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:40:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:40:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:40:57,715 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:40:57,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-10 22:40:57,773 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:40:57,773 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:40:57,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 22:40:57,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:40:57,845 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 13 treesize of output 9 [2024-11-10 22:40:57,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-10 22:40:58,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:40:58,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-10 22:40:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:58,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:40:58,216 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 53 treesize of output 49 [2024-11-10 22:40:58,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:40:58,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 164 [2024-11-10 22:40:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:40:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969940586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:40:58,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:40:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2024-11-10 22:40:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928568357] [2024-11-10 22:40:58,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:40:58,252 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:40:58,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:40:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 7 times [2024-11-10 22:40:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:40:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690258561] [2024-11-10 22:40:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:40:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:40:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:58,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:40:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:40:58,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:40:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:40:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 22:40:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-10 22:40:58,343 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 20 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-10 22:41:10,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 22:41:22,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 22:41:34,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 22:41:47,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 22:42:02,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 14.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 22:42:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:02,903 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-10 22:42:02,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2024-11-10 22:42:02,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-10 22:42:02,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 53 transitions. [2024-11-10 22:42:02,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-10 22:42:02,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-10 22:42:02,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2024-11-10 22:42:02,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:02,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-10 22:42:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2024-11-10 22:42:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2024-11-10 22:42:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 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-10 22:42:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-10 22:42:02,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-10 22:42:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:42:02,911 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-10 22:42:02,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:42:02,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2024-11-10 22:42:02,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:42:02,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:02,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:02,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:02,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:42:02,914 INFO L745 eck$LassoCheckResult]: Stem: 1159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1160#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1161#L367 assume !(main_~length~0#1 < 1); 1174#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1165#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1166#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1170#L375 assume true; 1171#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1172#L375 assume true; 1173#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1181#L375 assume true; 1178#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1179#L375 assume true; 1175#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 1167#L378 main_~j~0#1 := 1; 1168#L379 assume true; 1184#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1183#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1164#L379 assume true; 1157#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1158#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1169#L379 assume true; 1155#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1156#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1162#L379 [2024-11-10 22:42:02,914 INFO L747 eck$LassoCheckResult]: Loop: 1162#L379 assume true; 1163#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1182#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1162#L379 [2024-11-10 22:42:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1032133677, now seen corresponding path program 3 times [2024-11-10 22:42:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389307944] [2024-11-10 22:42:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:03,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389307944] [2024-11-10 22:42:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389307944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:03,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499831585] [2024-11-10 22:42:03,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:42:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:03,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:03,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-10 22:42:03,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 22:42:03,467 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:03,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:42:03,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:03,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499831585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:04,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2024-11-10 22:42:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985279989] [2024-11-10 22:42:04,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:04,349 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 39684, now seen corresponding path program 8 times [2024-11-10 22:42:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670782863] [2024-11-10 22:42:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:04,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:04,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 22:42:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-10 22:42:04,675 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-10 22:42:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:04,989 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-11-10 22:42:04,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2024-11-10 22:42:04,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:42:04,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 34 states and 38 transitions. [2024-11-10 22:42:04,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:42:04,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:42:04,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2024-11-10 22:42:04,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:04,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-10 22:42:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2024-11-10 22:42:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-10 22:42:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 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-10 22:42:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-10 22:42:04,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-10 22:42:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 22:42:04,998 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-10 22:42:04,998 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:42:04,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2024-11-10 22:42:04,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:42:04,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:05,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:05,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:05,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:42:05,001 INFO L745 eck$LassoCheckResult]: Stem: 1394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1395#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1396#L367 assume !(main_~length~0#1 < 1); 1409#L368 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1401#L371-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1402#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1405#L375 assume true; 1406#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1407#L375 assume true; 1408#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1417#L375 assume true; 1416#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1414#L375 assume true; 1413#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1411#L375 assume true; 1412#L375-1 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1423#L375 assume true; 1422#L375-1 assume !(main_~i~0#1 < main_~length~0#1); 1421#L378 main_~j~0#1 := 1; 1420#L379 assume true; 1400#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1419#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1418#L379 assume true; 1390#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1391#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1397#L379 [2024-11-10 22:42:05,001 INFO L747 eck$LassoCheckResult]: Loop: 1397#L379 assume true; 1398#L379-1 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1415#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1397#L379 [2024-11-10 22:42:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1097211932, now seen corresponding path program 4 times [2024-11-10 22:42:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010563793] [2024-11-10 22:42:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010563793] [2024-11-10 22:42:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010563793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922643983] [2024-11-10 22:42:06,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:42:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:06,139 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:06,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-10 22:42:06,206 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:42:06,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:06,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 22:42:06,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:06,562 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 13 treesize of output 9 [2024-11-10 22:42:06,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-10 22:42:06,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:42:06,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2024-11-10 22:42:07,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 22:42:07,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 22:42:07,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:42:07,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2024-11-10 22:42:07,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 22:42:07,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-10 22:42:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:07,820 INFO L311 TraceCheckSpWp]: Computing backward predicates...