./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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-memory-alloca/java_Sequence-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 d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:20:18,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:20:18,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:20:18,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:20:18,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:20:18,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:20:18,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:20:18,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:20:18,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:20:18,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:20:18,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:20:18,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:20:18,931 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:20:18,932 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:20:18,933 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:20:18,933 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:20:18,933 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:20:18,933 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:20:18,934 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:20:18,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:20:18,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:20:18,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:20:18,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:20:18,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:20:18,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:20:18,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:20:18,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:20:18,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:20:18,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:20:18,937 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:20:18,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:20:18,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:20:18,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:20:18,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:20:18,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:20:18,938 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:20:18,939 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 -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2024-11-19 14:20:19,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:20:19,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:20:19,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:20:19,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:20:19,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:20:19,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-11-19 14:20:20,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:20:20,953 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:20:20,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-11-19 14:20:20,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d728f2/f142f29e8af4462cbc6b07d92f66f92a/FLAGbab6f54b4 [2024-11-19 14:20:21,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d728f2/f142f29e8af4462cbc6b07d92f66f92a [2024-11-19 14:20:21,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:20:21,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:20:21,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:20:21,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:20:21,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:20:21,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686e265a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21, skipping insertion in model container [2024-11-19 14:20:21,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:20:21,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:20:21,692 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:20:21,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:20:21,774 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:20:21,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21 WrapperNode [2024-11-19 14:20:21,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:20:21,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:20:21,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:20:21,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:20:21,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,809 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-19 14:20:21,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:20:21,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:20:21,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:20:21,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:20:21,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,835 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 6, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 3, 2]. [2024-11-19 14:20:21,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:20:21,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:20:21,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:20:21,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:20:21,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (1/1) ... [2024-11-19 14:20:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:21,897 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-19 14:20:21,900 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-19 14:20:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:20:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:20:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:20:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:20:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:20:22,050 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:20:22,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:20:22,247 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-19 14:20:22,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:20:22,257 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:20:22,258 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:20:22,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:20:22 BoogieIcfgContainer [2024-11-19 14:20:22,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:20:22,260 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:20:22,260 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:20:22,264 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:20:22,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:22,266 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:20:21" (1/3) ... [2024-11-19 14:20:22,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4670d472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:20:22, skipping insertion in model container [2024-11-19 14:20:22,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:22,268 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:21" (2/3) ... [2024-11-19 14:20:22,269 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4670d472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:20:22, skipping insertion in model container [2024-11-19 14:20:22,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:22,270 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:20:22" (3/3) ... [2024-11-19 14:20:22,271 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2024-11-19 14:20:22,333 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:20:22,334 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:20:22,334 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:20:22,335 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:20:22,335 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:20:22,335 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:20:22,335 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:20:22,337 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:20:22,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-19 14:20:22,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-19 14:20:22,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:22,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:22,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:20:22,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:22,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:20:22,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-19 14:20:22,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-19 14:20:22,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:22,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:22,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:20:22,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:22,376 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 4#L552-4true [2024-11-19 14:20:22,377 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 3#L552-3true call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4#L552-4true [2024-11-19 14:20:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:20:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736296317] [2024-11-19 14:20:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:22,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2024-11-19 14:20:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866080897] [2024-11-19 14:20:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:22,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2024-11-19 14:20:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338963676] [2024-11-19 14:20:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:23,367 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:23,368 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:23,368 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:23,368 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:23,368 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:23,369 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:23,369 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:23,369 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:23,369 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2024-11-19 14:20:23,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:23,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:23,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:23,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:24,089 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:24,093 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,097 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-19 14:20:24,099 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-19 14:20:24,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:24,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,138 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-19 14:20:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,140 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-19 14:20:24,142 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-19 14:20:24,144 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-19 14:20:24,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,170 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-19 14:20:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,173 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-19 14:20:24,174 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-19 14:20:24,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:24,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,211 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-19 14:20:24,214 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-19 14:20:24,219 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-19 14:20:24,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:20:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,249 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-19 14:20:24,252 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-19 14:20:24,253 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-19 14:20:24,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,290 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-19 14:20:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,292 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-19 14:20:24,294 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-19 14:20:24,295 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-19 14:20:24,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,325 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-19 14:20:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,326 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-19 14:20:24,327 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-19 14:20:24,328 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-19 14:20:24,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:24,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,362 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-19 14:20:24,364 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-19 14:20:24,365 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-19 14:20:24,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:24,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,397 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-19 14:20:24,400 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-19 14:20:24,401 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-19 14:20:24,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:24,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:24,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:24,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,433 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-19 14:20:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,435 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-19 14:20:24,436 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-19 14:20:24,438 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-19 14:20:24,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:24,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,481 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-19 14:20:24,483 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-19 14:20:24,483 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-19 14:20:24,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:24,515 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-19 14:20:24,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,518 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-19 14:20:24,519 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-19 14:20:24,520 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-19 14:20:24,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:24,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:24,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:24,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:24,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:24,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:24,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:24,548 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:20:24,549 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:20:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:24,552 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-19 14:20:24,553 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-19 14:20:24,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:24,567 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:24,567 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:24,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2024-11-19 14:20:24,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:24,627 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-11-19 14:20:24,634 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 14:20:24,635 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 14:20:24,635 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-19 14:20:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:24,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:20:24,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:24,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:20:24,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:24,772 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-19 14:20:24,803 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:20:24,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-19 14:20:24,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 30 states and 37 transitions. Complement of second has 10 states. [2024-11-19 14:20:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-19 14:20:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-11-19 14:20:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-19 14:20:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-19 14:20:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-19 14:20:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:24,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2024-11-19 14:20:24,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:24,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 13 transitions. [2024-11-19 14:20:24,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:20:24,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:24,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-19 14:20:24,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:24,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-19 14:20:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-19 14:20:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-19 14:20:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-19 14:20:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-11-19 14:20:24,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-19 14:20:24,901 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-19 14:20:24,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:20:24,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-11-19 14:20:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:24,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:24,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:24,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:20:24,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:24,902 INFO L745 eck$LassoCheckResult]: Stem: 157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 151#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 154#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 155#L553-4 [2024-11-19 14:20:24,902 INFO L747 eck$LassoCheckResult]: Loop: 155#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 156#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 155#L553-4 [2024-11-19 14:20:24,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2024-11-19 14:20:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:24,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084400497] [2024-11-19 14:20:24,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:25,037 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-19 14:20:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084400497] [2024-11-19 14:20:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084400497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:20:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:20:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:20:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577372480] [2024-11-19 14:20:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:20:25,043 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2024-11-19 14:20:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310965035] [2024-11-19 14:20:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:25,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:25,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:25,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:20:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:20:25,176 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-19 14:20:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:25,200 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-11-19 14:20:25,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-11-19 14:20:25,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:25,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 14 transitions. [2024-11-19 14:20:25,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:20:25,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:25,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-19 14:20:25,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:25,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-19 14:20:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-19 14:20:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-11-19 14:20:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-19 14:20:25,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-19 14:20:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:20:25,204 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-19 14:20:25,204 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:20:25,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-11-19 14:20:25,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:25,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:25,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:25,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:25,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:25,206 INFO L745 eck$LassoCheckResult]: Stem: 191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 192#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 185#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 186#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 183#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 184#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 187#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 188#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 189#L553-4 [2024-11-19 14:20:25,206 INFO L747 eck$LassoCheckResult]: Loop: 189#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 193#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 190#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 189#L553-4 [2024-11-19 14:20:25,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2024-11-19 14:20:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971031643] [2024-11-19 14:20:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:25,433 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-19 14:20:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971031643] [2024-11-19 14:20:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971031643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640629578] [2024-11-19 14:20:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:25,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:25,435 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:25,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 14:20:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:25,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:20:25,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:25,526 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 11 treesize of output 7 [2024-11-19 14:20:25,542 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 23 treesize of output 3 [2024-11-19 14:20:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 14:20:25,552 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-19 14:20:25,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:25,600 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-19 14:20:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640629578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:25,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-19 14:20:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211891877] [2024-11-19 14:20:25,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:25,601 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2024-11-19 14:20:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27921647] [2024-11-19 14:20:25,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:25,611 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:25,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:25,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:25,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:25,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:20:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:20:25,700 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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-19 14:20:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:25,761 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-19 14:20:25,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-19 14:20:25,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:25,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 23 transitions. [2024-11-19 14:20:25,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:20:25,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:25,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-11-19 14:20:25,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:25,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-19 14:20:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-11-19 14:20:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-19 14:20:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-19 14:20:25,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-19 14:20:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:20:25,767 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-19 14:20:25,768 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:20:25,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2024-11-19 14:20:25,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:25,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:25,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:25,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-19 14:20:25,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:25,770 INFO L745 eck$LassoCheckResult]: Stem: 288#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 282#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 283#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 280#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 281#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 284#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 299#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 298#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 296#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 295#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 293#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 294#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 292#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 285#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 286#L553-4 [2024-11-19 14:20:25,770 INFO L747 eck$LassoCheckResult]: Loop: 286#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 290#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 287#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 286#L553-4 [2024-11-19 14:20:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 2 times [2024-11-19 14:20:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:25,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365919499] [2024-11-19 14:20:25,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:25,799 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:25,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365919499] [2024-11-19 14:20:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365919499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414034502] [2024-11-19 14:20:26,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:26,248 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-19 14:20:26,250 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-19 14:20:26,324 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:26,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:26,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:20:26,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:26,338 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 11 treesize of output 7 [2024-11-19 14:20:26,351 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 23 treesize of output 3 [2024-11-19 14:20:26,360 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 36 treesize of output 13 [2024-11-19 14:20:26,371 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 36 treesize of output 13 [2024-11-19 14:20:26,383 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 36 treesize of output 13 [2024-11-19 14:20:26,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 14:20:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:26,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414034502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:26,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 19 [2024-11-19 14:20:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955984007] [2024-11-19 14:20:26,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:26,514 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2024-11-19 14:20:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110586939] [2024-11-19 14:20:26,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:26,520 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:20:26,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:26,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:26,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 14:20:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2024-11-19 14:20:26,597 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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-19 14:20:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:26,745 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-19 14:20:26,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2024-11-19 14:20:26,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:26,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 41 transitions. [2024-11-19 14:20:26,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:20:26,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:26,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2024-11-19 14:20:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:26,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-19 14:20:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2024-11-19 14:20:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-19 14:20:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 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-19 14:20:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-19 14:20:26,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-19 14:20:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:20:26,752 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-19 14:20:26,752 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:20:26,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2024-11-19 14:20:26,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:26,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:26,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:26,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1] [2024-11-19 14:20:26,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:26,755 INFO L745 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 478#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 479#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 476#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 477#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 480#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 513#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 512#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 511#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 510#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 509#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 508#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 507#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 506#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 505#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 504#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 503#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 502#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 501#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 500#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 499#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 498#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 497#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 496#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 495#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 494#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 493#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 492#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 491#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 489#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 490#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 488#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 487#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 481#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 482#L553-4 [2024-11-19 14:20:26,755 INFO L747 eck$LassoCheckResult]: Loop: 482#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 486#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 483#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 482#L553-4 [2024-11-19 14:20:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1419508405, now seen corresponding path program 3 times [2024-11-19 14:20:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:26,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688898686] [2024-11-19 14:20:26,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:26,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:20:26,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688898686] [2024-11-19 14:20:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688898686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600003294] [2024-11-19 14:20:28,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:28,548 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:28,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 14:20:28,810 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:20:28,810 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:28,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 14:20:28,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:28,828 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 11 treesize of output 7 [2024-11-19 14:20:28,852 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 23 treesize of output 3 [2024-11-19 14:20:28,879 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 36 treesize of output 13 [2024-11-19 14:20:28,896 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 36 treesize of output 13 [2024-11-19 14:20:28,912 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 36 treesize of output 13 [2024-11-19 14:20:28,925 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 36 treesize of output 13 [2024-11-19 14:20:28,938 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 36 treesize of output 13 [2024-11-19 14:20:28,951 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 36 treesize of output 13 [2024-11-19 14:20:28,965 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 36 treesize of output 13 [2024-11-19 14:20:28,978 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 36 treesize of output 13 [2024-11-19 14:20:28,990 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 36 treesize of output 13 [2024-11-19 14:20:28,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 14:20:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:28,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600003294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:29,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 37 [2024-11-19 14:20:29,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860881857] [2024-11-19 14:20:29,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:29,335 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2024-11-19 14:20:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525588044] [2024-11-19 14:20:29,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:29,342 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:29,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:29,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:29,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 14:20:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=782, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 14:20:29,413 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. cyclomatic complexity: 3 Second operand has 37 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 37 states have internal predecessors, (85), 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-19 14:20:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:29,867 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-19 14:20:29,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 89 transitions. [2024-11-19 14:20:29,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:29,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 77 transitions. [2024-11-19 14:20:29,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:20:29,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:29,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 77 transitions. [2024-11-19 14:20:29,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:29,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-19 14:20:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 77 transitions. [2024-11-19 14:20:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-19 14:20:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-19 14:20:29,879 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-19 14:20:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-19 14:20:29,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-19 14:20:29,881 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:20:29,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 75 transitions. [2024-11-19 14:20:29,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:29,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:29,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:29,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1, 1, 1] [2024-11-19 14:20:29,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:29,889 INFO L745 eck$LassoCheckResult]: Stem: 886#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 887#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 880#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 881#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 878#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 879#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 882#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 951#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 950#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 949#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 948#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 947#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 946#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 945#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 944#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 943#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 942#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 941#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 940#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 939#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 938#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 937#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 936#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 935#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 934#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 933#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 932#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 931#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 930#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 929#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 928#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 927#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 926#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 925#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 924#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 923#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 922#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 921#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 920#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 919#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 918#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 917#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 916#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 915#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 914#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 913#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 912#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 911#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 910#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 909#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 908#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 907#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 906#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 905#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 904#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 903#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 902#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 901#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 900#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 899#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 898#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 897#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 896#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 895#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 894#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 893#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 891#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 892#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 890#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 889#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 883#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 884#L553-4 [2024-11-19 14:20:29,890 INFO L747 eck$LassoCheckResult]: Loop: 884#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 888#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 885#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 884#L553-4 [2024-11-19 14:20:29,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1124348107, now seen corresponding path program 4 times [2024-11-19 14:20:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924177379] [2024-11-19 14:20:29,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:29,935 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:29,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924177379] [2024-11-19 14:20:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924177379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654428256] [2024-11-19 14:20:32,835 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:32,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:32,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:32,838 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:32,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 14:20:33,232 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:33,233 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:33,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 14:20:33,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:33,246 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 11 treesize of output 7 [2024-11-19 14:20:33,258 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 23 treesize of output 3 [2024-11-19 14:20:33,273 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 36 treesize of output 13 [2024-11-19 14:20:33,283 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 36 treesize of output 13 [2024-11-19 14:20:33,292 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 36 treesize of output 13 [2024-11-19 14:20:33,301 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 36 treesize of output 13 [2024-11-19 14:20:33,311 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 36 treesize of output 13 [2024-11-19 14:20:33,320 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 36 treesize of output 13 [2024-11-19 14:20:33,330 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 36 treesize of output 13 [2024-11-19 14:20:33,339 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 36 treesize of output 13 [2024-11-19 14:20:33,349 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 36 treesize of output 13 [2024-11-19 14:20:33,359 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 36 treesize of output 13 [2024-11-19 14:20:33,376 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 36 treesize of output 13 [2024-11-19 14:20:33,385 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 36 treesize of output 13 [2024-11-19 14:20:33,395 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 36 treesize of output 13 [2024-11-19 14:20:33,409 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 36 treesize of output 13 [2024-11-19 14:20:33,421 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 36 treesize of output 13 [2024-11-19 14:20:33,435 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 36 treesize of output 13 [2024-11-19 14:20:33,448 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 36 treesize of output 13 [2024-11-19 14:20:33,458 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 36 treesize of output 13 [2024-11-19 14:20:33,468 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 36 treesize of output 13 [2024-11-19 14:20:33,481 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 36 treesize of output 13 [2024-11-19 14:20:33,493 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 36 treesize of output 13 [2024-11-19 14:20:33,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 14:20:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:33,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:34,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654428256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:34,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:34,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2024-11-19 14:20:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093876983] [2024-11-19 14:20:34,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:34,423 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2024-11-19 14:20:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594027908] [2024-11-19 14:20:34,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:34,429 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:34,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:34,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:34,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 14:20:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 14:20:34,502 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. cyclomatic complexity: 3 Second operand has 50 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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-19 14:20:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:35,710 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2024-11-19 14:20:35,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 173 transitions. [2024-11-19 14:20:35,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:35,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 148 states and 149 transitions. [2024-11-19 14:20:35,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:20:35,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:20:35,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 149 transitions. [2024-11-19 14:20:35,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:35,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 149 transitions. [2024-11-19 14:20:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 149 transitions. [2024-11-19 14:20:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-19 14:20:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.0068493150684932) internal successors, (147), 145 states have internal predecessors, (147), 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-19 14:20:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2024-11-19 14:20:35,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-11-19 14:20:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-19 14:20:35,723 INFO L425 stractBuchiCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-11-19 14:20:35,723 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:20:35,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 147 transitions. [2024-11-19 14:20:35,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:35,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:35,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:35,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1, 1, 1] [2024-11-19 14:20:35,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:35,737 INFO L745 eck$LassoCheckResult]: Stem: 1697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 1691#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1692#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1689#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1690#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1693#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1834#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1833#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1832#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1831#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1830#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1829#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1828#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1827#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1826#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1825#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1824#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1823#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1822#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1821#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1820#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1819#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1818#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1817#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1816#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1815#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1814#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1813#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1812#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1811#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1810#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1809#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1808#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1807#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1806#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1805#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1804#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1803#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1802#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1801#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1800#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1799#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1798#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1797#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1796#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1795#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1794#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1793#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1792#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1791#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1790#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1789#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1788#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1787#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1786#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1785#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1784#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1783#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1782#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1781#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1780#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1779#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1778#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1777#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1776#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1775#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1774#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1773#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1772#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1771#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1770#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1769#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1768#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1767#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1766#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1765#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1764#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1763#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1762#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1761#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1760#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1759#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1758#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1757#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1756#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1755#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1754#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1753#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1752#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1751#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1750#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1749#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1748#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1747#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1746#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1745#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1744#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1743#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1742#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1741#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1740#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1739#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1738#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1737#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1736#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1735#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1734#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1733#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1732#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1731#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1730#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1729#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1728#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1727#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1726#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1725#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1724#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1723#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1722#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1721#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1720#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1719#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1718#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1717#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1716#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1715#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1714#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1713#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1712#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1711#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1710#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1709#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1708#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1707#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1706#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1705#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1704#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1702#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1703#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1701#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1700#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 1694#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 1695#L553-4 [2024-11-19 14:20:35,738 INFO L747 eck$LassoCheckResult]: Loop: 1695#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 1699#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1696#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 1695#L553-4 [2024-11-19 14:20:35,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash 209012683, now seen corresponding path program 5 times [2024-11-19 14:20:35,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:35,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838734483] [2024-11-19 14:20:35,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:35,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:36,228 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-19 14:20:36,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838734483] [2024-11-19 14:20:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838734483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140745295] [2024-11-19 14:20:46,199 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:46,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:46,201 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:46,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process