./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:39:09,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:39:09,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:39:09,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:39:09,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:39:09,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:39:09,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:39:09,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:39:09,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:39:09,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:39:09,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:39:09,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:39:09,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:39:09,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:39:09,765 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:39:09,765 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:39:09,765 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:39:09,766 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:39:09,766 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:39:09,766 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:39:09,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:39:09,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:39:09,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:39:09,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:39:09,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:39:09,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:39:09,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:39:09,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:39:09,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:39:09,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:39:09,770 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:39:09,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:39:09,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:39:09,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:39:09,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:39:09,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:39:09,772 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:39:09,772 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-10 22:39:10,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:39:10,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:39:10,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:39:10,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:39:10,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:39:10,086 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-10 22:39:11,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:39:11,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:39:11,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-11-10 22:39:11,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b98f15c/230b9736de8d486dbfb3c5463391b6ac/FLAG55091361a [2024-11-10 22:39:11,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b98f15c/230b9736de8d486dbfb3c5463391b6ac [2024-11-10 22:39:11,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:39:11,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:39:11,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:39:11,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:39:11,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:39:11,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:11" (1/1) ... [2024-11-10 22:39:11,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7b2df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:11, skipping insertion in model container [2024-11-10 22:39:11,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:11" (1/1) ... [2024-11-10 22:39:11,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:39:12,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:39:12,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:39:12,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:39:12,211 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:39:12,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12 WrapperNode [2024-11-10 22:39:12,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:39:12,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:39:12,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:39:12,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:39:12,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,256 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-10 22:39:12,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:39:12,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:39:12,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:39:12,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:39:12,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,289 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [6, 4, 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 [3, 2, 2]. [2024-11-10 22:39:12,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:39:12,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:39:12,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:39:12,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:39:12,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (1/1) ... [2024-11-10 22:39:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:12,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:12,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:39:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:39:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:39:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 22:39:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:39:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:39:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 22:39:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:39:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:39:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:39:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:39:12,529 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:39:12,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:39:12,688 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~mem12#1;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; [2024-11-10 22:39:12,697 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 22:39:12,701 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:39:12,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:39:12,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:39:12,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:12 BoogieIcfgContainer [2024-11-10 22:39:12,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:39:12,714 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:39:12,716 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:39:12,720 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:39:12,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:39:12,721 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:39:11" (1/3) ... [2024-11-10 22:39:12,722 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f76c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:39:12, skipping insertion in model container [2024-11-10 22:39:12,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:39:12,723 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:12" (2/3) ... [2024-11-10 22:39:12,723 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f76c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:39:12, skipping insertion in model container [2024-11-10 22:39:12,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:39:12,724 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:39:12" (3/3) ... [2024-11-10 22:39:12,725 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2024-11-10 22:39:12,772 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:39:12,772 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:39:12,772 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:39:12,772 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:39:12,773 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:39:12,773 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:39:12,773 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:39:12,773 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:39:12,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:12,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-10 22:39:12,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:12,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:12,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:39:12,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:12,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:39:12,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:12,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-10 22:39:12,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:12,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:12,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:39:12,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:12,806 INFO L745 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#ULTIMATE.init_returnLabel#1true assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 11#L552true [2024-11-10 22:39:12,806 INFO L747 eck$LassoCheckResult]: Loop: 11#L552true assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 2#L552-2true assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 11#L552true [2024-11-10 22:39:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2024-11-10 22:39:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679621059] [2024-11-10 22:39:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:12,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:13,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2024-11-10 22:39:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527081147] [2024-11-10 22:39:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:13,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:13,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times [2024-11-10 22:39:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:13,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719969835] [2024-11-10 22:39:13,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:13,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:13,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:13,752 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:39:13,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:39:13,753 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:39:13,753 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:39:13,753 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:39:13,753 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:13,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:39:13,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:39:13,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2024-11-10 22:39:13,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:39:13,754 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:39:13,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:13,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:13,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:13,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:13,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:13,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:39:14,545 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:39:14,549 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:39:14,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:39:14,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:39:14,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:39:14,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:39:14,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:39:14,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:39:14,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:39:14,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:39:14,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:39:14,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:39:14,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:39:14,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:39:14,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:39:14,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:39:14,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:39:14,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:39:14,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:39:14,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:39:14,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:39:14,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,685 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-10 22:39:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:39:14,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:39:14,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:39:14,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:39:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:39:14,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:39:14,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:39:14,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:39:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,777 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:39:14,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:39:14,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:39:14,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:39:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:39:14,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:39:14,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:39:14,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:39:14,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:39:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:39:14,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:39:14,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:39:14,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:39:14,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:39:14,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:39:14,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:39:14,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:39:14,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:39:14,907 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-10 22:39:14,907 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-10 22:39:14,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:39:14,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:14,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:39:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:39:14,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:39:14,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:39:14,934 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:39:14,934 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) 0)_1 + 199 Supporting invariants [] [2024-11-10 22:39:14,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 22:39:14,996 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2024-11-10 22:39:15,009 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 22:39:15,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 22:39:15,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-10 22:39:15,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:15,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:39:15,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:15,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 22:39:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:15,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:39:15,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:15,180 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:39:15,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:15,252 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 25 states and 32 transitions. Complement of second has 8 states. [2024-11-10 22:39:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:39:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-11-10 22:39:15,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-10 22:39:15,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:39:15,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-10 22:39:15,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:39:15,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-10 22:39:15,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:39:15,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-11-10 22:39:15,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:15,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 9 states and 11 transitions. [2024-11-10 22:39:15,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-10 22:39:15,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:15,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2024-11-10 22:39:15,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:15,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-10 22:39:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2024-11-10 22:39:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-10 22:39:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-10 22:39:15,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-10 22:39:15,291 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-10 22:39:15,291 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:39:15,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-10 22:39:15,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:15,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:15,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:15,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:39:15,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:15,292 INFO L745 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 144#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 145#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 148#L553 [2024-11-10 22:39:15,293 INFO L747 eck$LassoCheckResult]: Loop: 148#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 149#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 148#L553 [2024-11-10 22:39:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash 45773773, now seen corresponding path program 1 times [2024-11-10 22:39:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080417624] [2024-11-10 22:39:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080417624] [2024-11-10 22:39:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080417624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:39:15,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:39:15,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:39:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317855062] [2024-11-10 22:39:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:39:15,491 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:39:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2024-11-10 22:39:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555374890] [2024-11-10 22:39:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:15,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:15,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:39:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:39:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:39:15,607 INFO L87 Difference]: Start difference. First operand 9 states and 11 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-10 22:39:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:39:15,632 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-11-10 22:39:15,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-11-10 22:39:15,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:15,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 11 transitions. [2024-11-10 22:39:15,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:39:15,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:15,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-10 22:39:15,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:15,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-10 22:39:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-10 22:39:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-10 22:39:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-10 22:39:15,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 22:39:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:39:15,637 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 22:39:15,638 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:39:15,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-10 22:39:15,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:15,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:15,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:15,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-10 22:39:15,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:15,639 INFO L745 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 181#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 175#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 176#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 173#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 174#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 177#L553 [2024-11-10 22:39:15,639 INFO L747 eck$LassoCheckResult]: Loop: 177#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 178#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 177#L553 [2024-11-10 22:39:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1038987662, now seen corresponding path program 1 times [2024-11-10 22:39:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309765556] [2024-11-10 22:39:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309765556] [2024-11-10 22:39:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309765556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:39:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451847730] [2024-11-10 22:39:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:15,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:39:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:15,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:39:15,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 22:39:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:15,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:39:15,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:15,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:39:15,934 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 25 treesize of output 13 [2024-11-10 22:39:15,941 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-10 22:39:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:15,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:39:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451847730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:39:15,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:39:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-10 22:39:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298058113] [2024-11-10 22:39:15,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:39:15,981 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:39:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 2 times [2024-11-10 22:39:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611161251] [2024-11-10 22:39:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:15,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:15,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:39:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 22:39:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 22:39:16,075 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:39:16,134 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-10 22:39:16,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2024-11-10 22:39:16,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:16,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 17 transitions. [2024-11-10 22:39:16,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:39:16,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:16,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2024-11-10 22:39:16,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:16,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-10 22:39:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2024-11-10 22:39:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-10 22:39:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-10 22:39:16,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-10 22:39:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 22:39:16,140 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-10 22:39:16,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:39:16,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-10 22:39:16,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:16,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:16,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:16,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-10 22:39:16,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:16,145 INFO L745 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 264#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 265#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 266#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 267#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 259#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 260#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 271#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 270#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 269#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 268#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 257#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 258#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 261#L553 [2024-11-10 22:39:16,145 INFO L747 eck$LassoCheckResult]: Loop: 261#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 262#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 261#L553 [2024-11-10 22:39:16,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash -807853743, now seen corresponding path program 2 times [2024-11-10 22:39:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:16,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655089410] [2024-11-10 22:39:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655089410] [2024-11-10 22:39:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655089410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:39:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498699776] [2024-11-10 22:39:16,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:39:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:39:16,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:16,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:39:16,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 22:39:16,613 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:39:16,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:39:16,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 22:39:16,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:39:16,648 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 25 treesize of output 13 [2024-11-10 22:39:16,659 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 25 treesize of output 13 [2024-11-10 22:39:16,669 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 25 treesize of output 13 [2024-11-10 22:39:16,680 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 25 treesize of output 13 [2024-11-10 22:39:16,689 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-10 22:39:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:16,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:39:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498699776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:39:16,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:39:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 22:39:16,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830563834] [2024-11-10 22:39:16,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:39:16,791 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:39:16,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 3 times [2024-11-10 22:39:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878386782] [2024-11-10 22:39:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:16,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:16,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:39:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 22:39:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2024-11-10 22:39:16,878 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:39:17,030 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-10 22:39:17,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2024-11-10 22:39:17,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:17,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 28 states and 29 transitions. [2024-11-10 22:39:17,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:39:17,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:17,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2024-11-10 22:39:17,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:17,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-10 22:39:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2024-11-10 22:39:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-10 22:39:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-10 22:39:17,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-10 22:39:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 22:39:17,049 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-10 22:39:17,050 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:39:17,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2024-11-10 22:39:17,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:17,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:17,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:17,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-10 22:39:17,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:17,052 INFO L745 eck$LassoCheckResult]: Stem: 422#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 423#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 424#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 425#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 426#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 418#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 419#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 442#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 441#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 440#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 439#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 438#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 437#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 436#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 435#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 434#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 433#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 432#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 431#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 430#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 429#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 428#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 427#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 416#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 417#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 420#L553 [2024-11-10 22:39:17,052 INFO L747 eck$LassoCheckResult]: Loop: 420#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 421#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 420#L553 [2024-11-10 22:39:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1415621097, now seen corresponding path program 3 times [2024-11-10 22:39:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:17,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430830533] [2024-11-10 22:39:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430830533] [2024-11-10 22:39:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430830533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:39:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176147907] [2024-11-10 22:39:18,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:39:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:39:18,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:18,131 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:39:18,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 22:39:18,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 22:39:18,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:39:18,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 22:39:18,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:18,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:39:18,581 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 25 treesize of output 13 [2024-11-10 22:39:18,592 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 25 treesize of output 13 [2024-11-10 22:39:18,602 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 25 treesize of output 13 [2024-11-10 22:39:18,610 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 25 treesize of output 13 [2024-11-10 22:39:18,623 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 25 treesize of output 13 [2024-11-10 22:39:18,635 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 25 treesize of output 13 [2024-11-10 22:39:18,645 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 25 treesize of output 13 [2024-11-10 22:39:18,655 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 25 treesize of output 13 [2024-11-10 22:39:18,664 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 25 treesize of output 13 [2024-11-10 22:39:18,678 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 25 treesize of output 13 [2024-11-10 22:39:18,688 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-10 22:39:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:18,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:39:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176147907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:39:18,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:39:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-11-10 22:39:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121205060] [2024-11-10 22:39:18,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:39:18,957 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:39:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 4 times [2024-11-10 22:39:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662001808] [2024-11-10 22:39:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:18,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:18,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:39:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 22:39:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2024-11-10 22:39:19,048 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:39:19,460 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2024-11-10 22:39:19,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 65 transitions. [2024-11-10 22:39:19,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:19,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 52 states and 53 transitions. [2024-11-10 22:39:19,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:39:19,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:19,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 53 transitions. [2024-11-10 22:39:19,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:19,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-10 22:39:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 53 transitions. [2024-11-10 22:39:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-10 22:39:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-10 22:39:19,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-10 22:39:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 22:39:19,468 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-10 22:39:19,469 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:39:19,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2024-11-10 22:39:19,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:19,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:19,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:19,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1, 1, 1] [2024-11-10 22:39:19,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:19,471 INFO L745 eck$LassoCheckResult]: Stem: 731#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 732#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 733#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 734#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 735#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 727#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 728#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 775#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 774#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 773#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 772#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 771#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 770#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 769#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 768#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 767#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 766#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 765#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 764#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 763#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 762#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 761#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 760#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 759#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 758#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 757#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 756#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 755#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 754#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 753#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 752#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 751#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 750#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 749#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 748#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 747#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 746#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 745#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 744#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 743#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 742#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 741#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 740#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 739#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 738#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 737#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 736#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 725#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 726#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 729#L553 [2024-11-10 22:39:19,472 INFO L747 eck$LassoCheckResult]: Loop: 729#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 730#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 729#L553 [2024-11-10 22:39:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1680583517, now seen corresponding path program 4 times [2024-11-10 22:39:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652925760] [2024-11-10 22:39:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652925760] [2024-11-10 22:39:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652925760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:39:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745751968] [2024-11-10 22:39:22,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:39:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:39:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:22,089 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-10 22:39:22,090 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-10 22:39:22,254 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:39:22,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:39:22,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 22:39:22,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:39:22,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 22:39:22,282 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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,303 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 25 treesize of output 13 [2024-11-10 22:39:22,312 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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,331 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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,356 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 25 treesize of output 13 [2024-11-10 22:39:22,365 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 25 treesize of output 13 [2024-11-10 22:39:22,372 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 25 treesize of output 13 [2024-11-10 22:39:22,381 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 25 treesize of output 13 [2024-11-10 22:39:22,389 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 25 treesize of output 13 [2024-11-10 22:39:22,396 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 25 treesize of output 13 [2024-11-10 22:39:22,404 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 25 treesize of output 13 [2024-11-10 22:39:22,412 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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,434 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 25 treesize of output 13 [2024-11-10 22:39:22,441 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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,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 25 treesize of output 13 [2024-11-10 22:39:22,465 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 25 treesize of output 13 [2024-11-10 22:39:22,471 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-10 22:39:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:22,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:39:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:23,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745751968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:39:23,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:39:23,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2024-11-10 22:39:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121539893] [2024-11-10 22:39:23,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:39:23,402 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:39:23,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 5 times [2024-11-10 22:39:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276841913] [2024-11-10 22:39:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:23,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:39:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:39:23,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:39:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:39:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 22:39:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 22:39:23,482 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 51 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:39:24,696 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2024-11-10 22:39:24,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 125 transitions. [2024-11-10 22:39:24,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:24,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 100 states and 101 transitions. [2024-11-10 22:39:24,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:39:24,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-10 22:39:24,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 101 transitions. [2024-11-10 22:39:24,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:39:24,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-11-10 22:39:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 101 transitions. [2024-11-10 22:39:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-10 22:39:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:39:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2024-11-10 22:39:24,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-10 22:39:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-10 22:39:24,714 INFO L425 stractBuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2024-11-10 22:39:24,714 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:39:24,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 100 transitions. [2024-11-10 22:39:24,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:39:24,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:39:24,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:39:24,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1, 1, 1] [2024-11-10 22:39:24,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:39:24,721 INFO L745 eck$LassoCheckResult]: Stem: 1340#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1341#ULTIMATE.init_returnLabel#1 assume true;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#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 1342#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1343#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1344#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1336#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1337#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1432#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1431#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1430#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1429#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1428#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1427#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1426#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1425#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1424#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1423#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1422#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1421#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1420#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1419#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1418#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1417#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1416#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1415#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1414#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1413#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1412#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1411#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1410#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1409#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1408#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1407#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1406#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1405#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1404#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1403#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1402#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1401#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1400#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1399#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1398#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1397#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1396#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1395#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1394#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1393#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1392#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1391#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1390#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1389#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1388#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1387#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1386#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1385#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1384#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1383#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1382#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1381#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1380#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1379#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1378#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1377#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1376#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1375#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1374#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1373#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1372#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1371#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1370#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1369#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1368#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1367#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1366#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1365#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1364#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1363#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1362#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1361#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1360#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1359#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1358#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1357#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1356#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1355#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1354#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1353#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1352#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1351#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1350#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1349#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1348#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1347#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1346#L552-2 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(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; 1345#L552 assume true;call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 1334#L552-2 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 1335#L553-3 call write~int#2(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 1338#L553 [2024-11-10 22:39:24,721 INFO L747 eck$LassoCheckResult]: Loop: 1338#L553 assume true;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 1339#L553-2 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 1338#L553 [2024-11-10 22:39:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:39:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -451238469, now seen corresponding path program 5 times [2024-11-10 22:39:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:39:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443385516] [2024-11-10 22:39:24,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:39:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:39:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:39:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:39:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:39:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443385516] [2024-11-10 22:39:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443385516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:39:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761581535] [2024-11-10 22:39:31,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 22:39:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:39:31,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:39:31,473 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:39:31,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process