./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:46:00,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:46:00,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-07 23:46:00,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:46:00,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:46:00,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:46:00,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:46:00,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:46:00,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:46:00,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:46:00,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:46:00,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:46:00,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:46:00,675 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-07 23:46:00,675 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-07 23:46:00,676 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-07 23:46:00,676 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-07 23:46:00,676 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-07 23:46:00,676 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-07 23:46:00,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:46:00,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:46:00,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:46:00,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:46:00,678 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-07 23:46:00,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:46:00,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:46:00,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:46:00,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:46:00,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:46:00,679 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-07 23:46:00,679 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 [2024-11-07 23:46:00,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:46:01,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:46:01,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:46:01,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:46:01,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:46:01,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2024-11-07 23:46:02,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:46:02,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:46:02,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2024-11-07 23:46:02,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c34298e/b9f179055dad49db816a6037d71b0329/FLAG78c0c791e [2024-11-07 23:46:02,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c34298e/b9f179055dad49db816a6037d71b0329 [2024-11-07 23:46:02,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:46:02,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:46:02,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:46:02,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:46:02,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:46:02,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6404f8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02, skipping insertion in model container [2024-11-07 23:46:02,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:46:02,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:46:02,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:46:02,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:46:02,728 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:46:02,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02 WrapperNode [2024-11-07 23:46:02,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:46:02,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:46:02,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:46:02,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:46:02,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,749 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2024-11-07 23:46:02,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:46:02,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:46:02,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:46:02,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:46:02,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,766 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-07 23:46:02,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:46:02,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:46:02,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:46:02,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:46:02,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (1/1) ... [2024-11-07 23:46:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:02,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-07 23:46:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:46:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 23:46:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:46:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:46:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:46:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:46:02,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:46:02,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:46:03,006 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-07 23:46:03,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:46:03,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:46:03,014 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 23:46:03,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:46:03 BoogieIcfgContainer [2024-11-07 23:46:03,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:46:03,015 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-07 23:46:03,015 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-07 23:46:03,020 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-07 23:46:03,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:46:03,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:46:02" (1/3) ... [2024-11-07 23:46:03,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c7ae769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:46:03, skipping insertion in model container [2024-11-07 23:46:03,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:46:03,022 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:46:02" (2/3) ... [2024-11-07 23:46:03,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c7ae769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:46:03, skipping insertion in model container [2024-11-07 23:46:03,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:46:03,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:46:03" (3/3) ... [2024-11-07 23:46:03,024 INFO L332 chiAutomizerObserver]: Analyzing ICFG LexIndexValue-Pointer-2.c [2024-11-07 23:46:03,073 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-07 23:46:03,074 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-07 23:46:03,074 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-07 23:46:03,074 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-07 23:46:03,074 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-07 23:46:03,075 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-07 23:46:03,075 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-07 23:46:03,075 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-07 23:46:03,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:03,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-07 23:46:03,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:03,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:03,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:46:03,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:46:03,097 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-07 23:46:03,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:03,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-07 23:46:03,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:03,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:03,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:46:03,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:46:03,107 INFO L745 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 9#L18-3true [2024-11-07 23:46:03,107 INFO L747 eck$LassoCheckResult]: Loop: 9#L18-3true assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 7#L18-2true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 9#L18-3true [2024-11-07 23:46:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-07 23:46:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636029049] [2024-11-07 23:46:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:03,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:03,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-07 23:46:03,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223328173] [2024-11-07 23:46:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-07 23:46:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780647082] [2024-11-07 23:46:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:03,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:03,537 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:46:03,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:46:03,541 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:46:03,541 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:46:03,542 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:46:03,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:03,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:46:03,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:46:03,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: LexIndexValue-Pointer-2.c_Iteration1_Lasso [2024-11-07 23:46:03,542 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:46:03,542 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:46:03,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:46:03,974 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:46:03,977 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:46:03,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:03,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:03,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:03,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-07 23:46:03,985 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-07 23:46:03,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-07 23:46:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-07 23:46:04,027 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-07 23:46:04,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:46:04,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:46:04,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-07 23:46:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-07 23:46:04,069 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-07 23:46:04,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-07 23:46:04,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-07 23:46:04,108 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-07 23:46:04,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-07 23:46:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-07 23:46:04,152 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-07 23:46:04,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-07 23:46:04,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-07 23:46:04,191 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-07 23:46:04,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-07 23:46:04,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-07 23:46:04,227 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-07 23:46:04,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-07 23:46:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,262 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-07 23:46:04,265 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-07 23:46:04,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-07 23:46:04,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,301 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-07 23:46:04,304 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-07 23:46:04,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-07 23:46:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,339 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-07 23:46:04,342 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-07 23:46:04,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-07 23:46:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,377 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,397 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-07 23:46:04,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-07 23:46:04,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:46:04,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:46:04,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:46:04,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:46:04,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-07 23:46:04,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-07 23:46:04,442 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-07 23:46:04,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:46:04,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:46:04,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:46:04,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:46:04,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:46:04,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:46:04,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:46:04,528 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-07 23:46:04,530 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-07 23:46:04,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:46:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:04,536 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:46:04,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-07 23:46:04,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:46:04,554 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-07 23:46:04,555 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:46:04,555 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~p~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-07 23:46:04,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-07 23:46:04,583 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-07 23:46:04,593 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-07 23:46:04,596 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-07 23:46:04,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:04,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 23:46:04,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:04,665 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 23:46:04,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:04,706 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-07 23:46:04,737 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-07 23:46:04,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-07 23:46:04,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 24 states and 35 transitions. Complement of second has 6 states. [2024-11-07 23:46:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:46:04,815 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-07 23:46:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-07 23:46:04,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-07 23:46:04,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:46:04,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-07 23:46:04,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:46:04,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-07 23:46:04,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:46:04,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2024-11-07 23:46:04,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:04,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 10 states and 14 transitions. [2024-11-07 23:46:04,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-07 23:46:04,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:04,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2024-11-07 23:46:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:04,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-11-07 23:46:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2024-11-07 23:46:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-07 23:46:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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-07 23:46:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2024-11-07 23:46:04,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-11-07 23:46:04,854 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2024-11-07 23:46:04,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-07 23:46:04,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2024-11-07 23:46:04,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:04,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:04,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:04,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-07 23:46:04,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:04,857 INFO L745 eck$LassoCheckResult]: Stem: 98#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 99#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 96#L18-3 assume !(main_~i~0#1 < 1048); 95#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 94#L23-2 [2024-11-07 23:46:04,857 INFO L747 eck$LassoCheckResult]: Loop: 94#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 90#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 91#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 97#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 94#L23-2 [2024-11-07 23:46:04,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-07 23:46:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949311498] [2024-11-07 23:46:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:04,943 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-07 23:46:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949311498] [2024-11-07 23:46:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949311498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:46:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:46:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 23:46:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500201220] [2024-11-07 23:46:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:46:04,946 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:46:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 1 times [2024-11-07 23:46:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:04,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165723134] [2024-11-07 23:46:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:04,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:04,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:46:05,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:46:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:46:05,083 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 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-07 23:46:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:46:05,095 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2024-11-07 23:46:05,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2024-11-07 23:46:05,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2024-11-07 23:46:05,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:46:05,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:05,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-07 23:46:05,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:05,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-07 23:46:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-07 23:46:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-07 23:46:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-07 23:46:05,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-07 23:46:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:46:05,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-07 23:46:05,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-07 23:46:05,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2024-11-07 23:46:05,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:05,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:05,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-07 23:46:05,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:05,100 INFO L745 eck$LassoCheckResult]: Stem: 125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 122#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 119#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 120#L18-3 assume !(main_~i~0#1 < 1048); 123#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 121#L23-2 [2024-11-07 23:46:05,100 INFO L747 eck$LassoCheckResult]: Loop: 121#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 117#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 118#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 124#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 121#L23-2 [2024-11-07 23:46:05,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-07 23:46:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:05,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284241536] [2024-11-07 23:46:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284241536] [2024-11-07 23:46:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284241536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:46:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409964142] [2024-11-07 23:46:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:46:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:05,157 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:46:05,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 23:46:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:05,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 23:46:05,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:46:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409964142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:46:05,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:46:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-07 23:46:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619069327] [2024-11-07 23:46:05,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:46:05,233 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:46:05,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 2 times [2024-11-07 23:46:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322547446] [2024-11-07 23:46:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:05,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:05,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:05,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:46:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 23:46:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:46:05,365 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:46:05,415 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2024-11-07 23:46:05,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2024-11-07 23:46:05,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2024-11-07 23:46:05,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:46:05,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:05,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2024-11-07 23:46:05,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:05,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-07 23:46:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2024-11-07 23:46:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-07 23:46:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-07 23:46:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-07 23:46:05,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-07 23:46:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 23:46:05,422 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-07 23:46:05,422 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-07 23:46:05,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-07 23:46:05,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:05,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:05,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-07 23:46:05,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:05,424 INFO L745 eck$LassoCheckResult]: Stem: 192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 188#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 189#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 190#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 185#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 186#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 198#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 197#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 196#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 195#L18-3 assume !(main_~i~0#1 < 1048); 191#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 187#L23-2 [2024-11-07 23:46:05,424 INFO L747 eck$LassoCheckResult]: Loop: 187#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 183#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 184#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 194#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 187#L23-2 [2024-11-07 23:46:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-07 23:46:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370058341] [2024-11-07 23:46:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:05,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-07 23:46:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370058341] [2024-11-07 23:46:05,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370058341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:46:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345180518] [2024-11-07 23:46:05,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:46:05,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:46:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:05,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:46:05,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 23:46:05,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:46:05,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:46:05,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 23:46:05,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:46:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345180518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:46:05,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:46:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-07 23:46:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058253880] [2024-11-07 23:46:05,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:46:05,741 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:46:05,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 3 times [2024-11-07 23:46:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:05,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18607711] [2024-11-07 23:46:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:05,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:05,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:46:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 23:46:05,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-07 23:46:05,872 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:46:05,922 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-07 23:46:05,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2024-11-07 23:46:05,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2024-11-07 23:46:05,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:46:05,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:05,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-11-07 23:46:05,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:05,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-07 23:46:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-11-07 23:46:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-07 23:46:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-07 23:46:05,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-07 23:46:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 23:46:05,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-07 23:46:05,928 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-07 23:46:05,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2024-11-07 23:46:05,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:05,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:05,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:05,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-07 23:46:05,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:05,930 INFO L745 eck$LassoCheckResult]: Stem: 318#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 314#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 315#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 316#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 311#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 312#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 336#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 335#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 334#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 333#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 332#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 331#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 330#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 329#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 328#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 327#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 326#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 325#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 324#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 323#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 322#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 321#L18-3 assume !(main_~i~0#1 < 1048); 317#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 313#L23-2 [2024-11-07 23:46:05,930 INFO L747 eck$LassoCheckResult]: Loop: 313#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 309#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 310#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 320#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 313#L23-2 [2024-11-07 23:46:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-11-07 23:46:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947903168] [2024-11-07 23:46:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947903168] [2024-11-07 23:46:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947903168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:46:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777335725] [2024-11-07 23:46:06,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 23:46:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:46:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:06,257 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:46:06,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 23:46:06,373 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 23:46:06,373 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:46:06,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 23:46:06,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:06,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:46:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777335725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:46:06,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:46:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-07 23:46:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98189863] [2024-11-07 23:46:06,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:46:06,680 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:46:06,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 4 times [2024-11-07 23:46:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:06,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113781916] [2024-11-07 23:46:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:06,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:06,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:46:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 23:46:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-07 23:46:06,784 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:46:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:46:06,881 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-11-07 23:46:06,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 55 transitions. [2024-11-07 23:46:06,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:06,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 55 transitions. [2024-11-07 23:46:06,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:46:06,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:06,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2024-11-07 23:46:06,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:06,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-11-07 23:46:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2024-11-07 23:46:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 23:46:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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-07 23:46:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-11-07 23:46:06,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-11-07 23:46:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 23:46:06,893 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-11-07 23:46:06,893 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-07 23:46:06,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 55 transitions. [2024-11-07 23:46:06,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:06,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:06,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:06,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2024-11-07 23:46:06,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:06,898 INFO L745 eck$LassoCheckResult]: Stem: 565#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 560#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 561#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 562#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 557#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 558#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 606#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 605#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 604#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 603#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 602#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 601#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 600#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 599#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 598#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 597#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 596#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 595#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 594#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 593#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 592#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 591#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 590#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 589#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 588#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 587#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 586#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 585#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 584#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 583#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 582#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 581#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 580#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 579#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 578#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 577#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 576#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 575#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 574#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 573#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 572#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 571#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 570#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 569#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 568#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 567#L18-3 assume !(main_~i~0#1 < 1048); 563#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 559#L23-2 [2024-11-07 23:46:06,898 INFO L747 eck$LassoCheckResult]: Loop: 559#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 555#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 556#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 564#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 559#L23-2 [2024-11-07 23:46:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2024-11-07 23:46:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117153735] [2024-11-07 23:46:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:06,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117153735] [2024-11-07 23:46:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117153735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:46:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627899075] [2024-11-07 23:46:07,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 23:46:07,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:46:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:07,629 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:46:07,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-07 23:46:07,727 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 23:46:07,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:46:07,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 23:46:07,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:46:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:07,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:46:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627899075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:46:08,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:46:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-07 23:46:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363854395] [2024-11-07 23:46:08,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:46:08,680 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:46:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 5 times [2024-11-07 23:46:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473753263] [2024-11-07 23:46:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:08,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:46:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:46:08,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:46:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:46:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-07 23:46:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-07 23:46:08,782 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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-07 23:46:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:46:08,985 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2024-11-07 23:46:08,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 103 transitions. [2024-11-07 23:46:08,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:08,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 103 transitions. [2024-11-07 23:46:08,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:46:08,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:46:08,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 103 transitions. [2024-11-07 23:46:08,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:46:08,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2024-11-07 23:46:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 103 transitions. [2024-11-07 23:46:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 23:46:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.03) internal successors, (103), 99 states have internal predecessors, (103), 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-07 23:46:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2024-11-07 23:46:09,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2024-11-07 23:46:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-07 23:46:09,004 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 103 transitions. [2024-11-07 23:46:09,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-07 23:46:09,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 103 transitions. [2024-11-07 23:46:09,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:46:09,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:46:09,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:46:09,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2024-11-07 23:46:09,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:46:09,008 INFO L745 eck$LassoCheckResult]: Stem: 1051#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1052#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 1046#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1047#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1048#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1043#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1044#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1140#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1139#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1138#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1137#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1136#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1135#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1134#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1133#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1132#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1131#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1130#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1129#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1128#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1127#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1126#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1125#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1124#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1123#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1122#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1121#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1120#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1119#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1118#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1117#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1116#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1115#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1114#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1113#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1112#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1111#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1110#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1109#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1108#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1107#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1106#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1105#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1104#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1103#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1102#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1101#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1100#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1099#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1098#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1097#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1096#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1095#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1094#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1093#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1092#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1091#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1090#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1089#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1088#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1087#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1086#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1085#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1084#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1083#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1082#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1081#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1080#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1079#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1078#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1077#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1076#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1075#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1074#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1073#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1072#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1071#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1070#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1069#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1068#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1067#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1066#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1065#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1064#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1063#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1062#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1061#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1060#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1059#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1058#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1057#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1056#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1055#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1054#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1053#L18-3 assume !(main_~i~0#1 < 1048); 1049#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 1045#L23-2 [2024-11-07 23:46:09,009 INFO L747 eck$LassoCheckResult]: Loop: 1045#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 1041#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 1042#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 1050#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 1045#L23-2 [2024-11-07 23:46:09,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:46:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2024-11-07 23:46:09,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:46:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137583083] [2024-11-07 23:46:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:46:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:46:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:46:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:46:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:46:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137583083] [2024-11-07 23:46:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137583083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:46:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202686238] [2024-11-07 23:46:11,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 23:46:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:46:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:46:11,070 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:46:11,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-07 23:47:15,357 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-07 23:47:15,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:47:15,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 23:47:15,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:47:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:47:15,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:47:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:47:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202686238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:47:18,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:47:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-07 23:47:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877504085] [2024-11-07 23:47:18,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:47:18,127 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:47:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:47:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 6 times [2024-11-07 23:47:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:47:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282628118] [2024-11-07 23:47:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:47:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:47:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:47:18,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:47:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:47:18,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:47:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:47:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-07 23:47:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-07 23:47:18,239 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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-07 23:47:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:47:18,632 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2024-11-07 23:47:18,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 199 transitions. [2024-11-07 23:47:18,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:47:18,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 199 transitions. [2024-11-07 23:47:18,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:47:18,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:47:18,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 199 transitions. [2024-11-07 23:47:18,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:47:18,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2024-11-07 23:47:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 199 transitions. [2024-11-07 23:47:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-07 23:47:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.0153061224489797) internal successors, (199), 195 states have internal predecessors, (199), 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-07 23:47:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2024-11-07 23:47:18,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2024-11-07 23:47:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-07 23:47:18,655 INFO L425 stractBuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2024-11-07 23:47:18,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-07 23:47:18,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 199 transitions. [2024-11-07 23:47:18,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-07 23:47:18,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:47:18,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:47:18,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2024-11-07 23:47:18,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:47:18,670 INFO L745 eck$LassoCheckResult]: Stem: 2016#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~post3#1, main_~i~0#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_#t~post7#1.base, main_#t~post7#1.offset, main_#t~mem8#1, main_#t~post9#1, main_~p~0#1.base, main_~p~0#1.offset, main_~q~0#1.base, main_~q~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4192);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0; 2012#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2013#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2014#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2009#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2010#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2202#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2201#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2200#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2199#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2198#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2197#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2196#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2195#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2194#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2193#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2192#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2191#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2190#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2189#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2188#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2187#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2186#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2185#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2184#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2183#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2182#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2181#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2180#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2179#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2178#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2177#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2176#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2175#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2174#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2173#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2172#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2171#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2170#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2169#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2168#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2167#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2166#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2165#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2164#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2163#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2162#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2161#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2160#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2159#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2158#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2157#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2156#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2155#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2154#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2153#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2152#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2151#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2150#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2149#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2148#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2147#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2146#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2145#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2144#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2143#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2142#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2141#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2140#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2139#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2138#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2137#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2136#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2135#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2134#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2133#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2132#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2131#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2130#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2129#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2128#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2127#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2126#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2125#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2124#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2123#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2122#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2121#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2120#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2119#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2118#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2117#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2116#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2115#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2114#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2113#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2112#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2111#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2110#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2109#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2108#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2107#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2106#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2105#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2104#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2103#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2102#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2101#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2100#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2099#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2098#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2097#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2096#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2095#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2094#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2093#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2092#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2091#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2090#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2089#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2088#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2087#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2086#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2085#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2084#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2083#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2082#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2081#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2080#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2079#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2078#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2077#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2076#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2075#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2074#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2073#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2072#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2071#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2070#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2069#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2068#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2067#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2066#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2065#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2064#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2063#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2062#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2061#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2060#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2059#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2058#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2057#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2056#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2055#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2054#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2053#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2052#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2051#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2050#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2049#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2048#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2047#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2046#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2045#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2044#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2043#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2042#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2041#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2040#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2039#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2038#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2037#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2036#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2035#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2034#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2033#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2032#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2031#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2030#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2029#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2028#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2027#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2026#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2025#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2024#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2023#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2022#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2021#L18-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~q~0#1.base, main_~q~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2020#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2019#L18-3 assume !(main_~i~0#1 < 1048); 2015#L18-4 havoc main_~i~0#1;main_~q~0#1.base, main_~q~0#1.offset := main_~p~0#1.base, main_~p~0#1.offset; 2011#L23-2 [2024-11-07 23:47:18,670 INFO L747 eck$LassoCheckResult]: Loop: 2011#L23-2 assume main_~q~0#1.base == main_~p~0#1.base;main_#t~short5#1 := main_~q~0#1.offset < 4192 + main_~p~0#1.offset; 2007#L22-1 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~q~0#1.base, main_~q~0#1.offset, 4);main_#t~short5#1 := main_#t~mem4#1 >= 0; 2008#L22-3 assume !!main_#t~short5#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1; 2018#L23 assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_#t~post7#1.base, main_#t~post7#1.offset := main_~q~0#1.base, main_~q~0#1.offset;main_~q~0#1.base, main_~q~0#1.offset := main_#t~post7#1.base, 4 + main_#t~post7#1.offset;havoc main_#t~post7#1.base, main_#t~post7#1.offset; 2011#L23-2 [2024-11-07 23:47:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:47:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371207, now seen corresponding path program 6 times [2024-11-07 23:47:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:47:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070240042] [2024-11-07 23:47:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:47:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:47:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:47:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:47:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:47:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070240042] [2024-11-07 23:47:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070240042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:47:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845784647] [2024-11-07 23:47:24,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 23:47:24,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:47:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:47:24,298 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:47:24,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process