/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:11:36,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:11:36,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:11:36,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:11:36,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:11:36,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:11:36,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:11:36,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:11:36,846 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:11:36,846 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:11:36,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:11:36,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:11:36,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:11:36,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:11:36,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:11:36,848 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:11:36,848 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:11:37,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:11:37,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:11:37,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:11:37,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:11:37,086 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:11:37,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-26 16:11:38,435 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/abc20369c/1f407bc67a39424fb112ba38a79c7729/FLAG22b3b6f39 [2025-04-26 16:11:38,673 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:11:38,673 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-26 16:11:38,682 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/abc20369c/1f407bc67a39424fb112ba38a79c7729/FLAG22b3b6f39 [2025-04-26 16:11:39,486 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/abc20369c/1f407bc67a39424fb112ba38a79c7729 [2025-04-26 16:11:39,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:11:39,489 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:11:39,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:11:39,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:11:39,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:11:39,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cced43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39, skipping insertion in model container [2025-04-26 16:11:39,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:11:39,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:11:39,693 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:11:39,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:11:39,733 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:11:39,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39 WrapperNode [2025-04-26 16:11:39,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:11:39,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:11:39,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:11:39,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:11:39,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,764 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 123 [2025-04-26 16:11:39,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:11:39,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:11:39,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:11:39,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:11:39,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:11:39,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:11:39,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:11:39,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:11:39,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (1/1) ... [2025-04-26 16:11:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:39,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:11:39,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:11:39,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:11:39,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:11:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:11:39,836 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:11:39,899 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:11:39,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:11:40,086 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:11:40,086 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:11:40,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:11:40,094 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:11:40,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:11:40 BoogieIcfgContainer [2025-04-26 16:11:40,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:11:40,095 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:11:40,096 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:11:40,100 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:11:40,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:11:40,100 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:11:39" (1/3) ... [2025-04-26 16:11:40,101 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e67d76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:11:40, skipping insertion in model container [2025-04-26 16:11:40,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:11:40,101 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:11:39" (2/3) ... [2025-04-26 16:11:40,101 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e67d76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:11:40, skipping insertion in model container [2025-04-26 16:11:40,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:11:40,101 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:11:40" (3/3) ... [2025-04-26 16:11:40,102 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-26 16:11:40,175 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:11:40,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 171 transitions, 356 flow [2025-04-26 16:11:40,257 INFO L116 PetriNetUnfolderBase]: 10/167 cut-off events. [2025-04-26 16:11:40,259 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:11:40,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 167 events. 10/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 236 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-04-26 16:11:40,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 171 transitions, 356 flow [2025-04-26 16:11:40,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 167 transitions, 346 flow [2025-04-26 16:11:40,272 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 164 places, 167 transitions, 346 flow [2025-04-26 16:11:40,280 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:11:40,280 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:11:40,280 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:11:40,280 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:11:40,280 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:11:40,280 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:11:40,280 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:11:40,280 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:11:40,281 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:11:40,583 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 4693 [2025-04-26 16:11:40,583 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:40,584 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:40,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:40,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:40,589 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:11:40,589 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 4907 states, but on-demand construction may add more states [2025-04-26 16:11:40,645 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 4693 [2025-04-26 16:11:40,645 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:40,645 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:40,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:40,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:40,653 INFO L752 eck$LassoCheckResult]: Stem: "[241] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[249] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[321] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[263] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[312] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[280] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[326] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[237] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[364] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[367] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[246] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[275] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[362] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[318] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[299] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[227] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[368] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[328] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[232] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[363] L84-1-->L35: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[352] L35-->L36: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[361] L36-->L35-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[341] L35-1-->L84-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[238] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[248] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[267] L85-1-->L35-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] L35-2-->L36-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[298] L36-3-->L35-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[219] L35-3-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[214] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[270] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[220] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[215] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[319] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" [2025-04-26 16:11:40,654 INFO L754 eck$LassoCheckResult]: Loop: "[335] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[291] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[266] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[311] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[226] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[289] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[376] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" [2025-04-26 16:11:40,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 472204228, now seen corresponding path program 1 times [2025-04-26 16:11:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:40,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606737465] [2025-04-26 16:11:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:40,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:11:40,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:11:40,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:40,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:11:40,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:11:40,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:40,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1594870793, now seen corresponding path program 1 times [2025-04-26 16:11:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:40,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472715975] [2025-04-26 16:11:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:40,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:11:40,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:11:40,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:40,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:11:40,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:11:40,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:40,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1871790380, now seen corresponding path program 1 times [2025-04-26 16:11:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:40,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227174797] [2025-04-26 16:11:40,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:40,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:11:40,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:11:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:40,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:11:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:11:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:40,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:41,242 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:11:41,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:11:41,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:11:41,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:11:41,242 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:11:41,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:11:41,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:11:41,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:11:41,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:11:41,243 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:11:41,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:41,856 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:11:41,858 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:11:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:11:41,864 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 [2025-04-26 16:11:41,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:41,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:41,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:41,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:41,881 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:41,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:11:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:11:41,891 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 [2025-04-26 16:11:41,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:41,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:41,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:41,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:41,904 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:41,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:11:41,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:11:41,914 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 [2025-04-26 16:11:41,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:41,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:41,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:41,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:41,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:41,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:11:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:11:41,937 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 [2025-04-26 16:11:41,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:41,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:41,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:41,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:41,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:41,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:11:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:11:41,962 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 [2025-04-26 16:11:41,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:41,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:41,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:41,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:41,974 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:41,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:11:41,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:41,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:11:41,986 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 [2025-04-26 16:11:41,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:41,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:41,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:41,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:42,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:42,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:42,003 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:42,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:11:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:42,012 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:42,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:11:42,015 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 [2025-04-26 16:11:42,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:42,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:42,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:42,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:42,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:42,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:42,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:11:42,079 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:11:42,079 INFO L437 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:11:42,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:42,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:42,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:11:42,085 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:11:42,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:42,102 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:11:42,102 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:11:42,103 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -4*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2025-04-26 16:11:42,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:42,123 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 16:11:42,131 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:11:42,131 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:11:42,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:42,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:11:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:11:42,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:42,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:42,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:11:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:42,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:11:42,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:11:42,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:42,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:42,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:11:42,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:11:42,383 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2025-04-26 16:11:42,386 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 4907 states, but on-demand construction may add more states Second operand has 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:42,636 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 4907 states, but on-demand construction may add more states. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9802 states and 26532 transitions. Complement of second has 13 states. [2025-04-26 16:11:42,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:11:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2025-04-26 16:11:42,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 191 transitions. Stem has 36 letters. Loop has 7 letters. [2025-04-26 16:11:42,649 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:42,649 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 191 transitions. Stem has 43 letters. Loop has 7 letters. [2025-04-26 16:11:42,649 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:42,649 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 191 transitions. Stem has 36 letters. Loop has 14 letters. [2025-04-26 16:11:42,649 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:42,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9802 states and 26532 transitions. [2025-04-26 16:11:42,727 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 4686 [2025-04-26 16:11:42,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9802 states to 4841 states and 13119 transitions. [2025-04-26 16:11:42,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4832 [2025-04-26 16:11:42,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4834 [2025-04-26 16:11:42,778 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4841 states and 13119 transitions. [2025-04-26 16:11:42,792 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:11:42,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4841 states and 13119 transitions. [2025-04-26 16:11:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states and 13119 transitions. [2025-04-26 16:11:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 4840. [2025-04-26 16:11:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4840 states, 4840 states have (on average 2.7103305785123966) internal successors, (in total 13118), 4839 states have internal predecessors, (13118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13118 transitions. [2025-04-26 16:11:42,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4840 states and 13118 transitions. [2025-04-26 16:11:42,970 INFO L438 stractBuchiCegarLoop]: Abstraction has 4840 states and 13118 transitions. [2025-04-26 16:11:42,970 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:11:42,971 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4840 states and 13118 transitions. [2025-04-26 16:11:42,994 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 4686 [2025-04-26 16:11:42,994 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:42,994 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:42,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:42,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:42,996 INFO L752 eck$LassoCheckResult]: Stem: "[241] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[249] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[321] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[263] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[312] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[280] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[326] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[237] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[364] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[367] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[246] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[275] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[362] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[318] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[299] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[227] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[368] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[328] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[232] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[363] L84-1-->L35: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[352] L35-->L36: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[361] L36-->L35-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[341] L35-1-->L84-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[238] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[248] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[267] L85-1-->L35-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] L35-2-->L36-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[298] L36-3-->L35-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[219] L35-3-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[214] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[270] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[220] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[215] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[319] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[334] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[300] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[233] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[347] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[245] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[213] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[264] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[371] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[283] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[287] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[217] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[464] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[380] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[381] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" [2025-04-26 16:11:42,997 INFO L754 eck$LassoCheckResult]: Loop: "[383] L48-5-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[385] L49-->L49-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_1))) (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_1| (select (select |v_#memory_int_1| v_~A~0.base_1) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {#memory_int=|v_#memory_int_1|, ~A~0.base=v_~A~0.base_1, #length=|v_#length_1|, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|} OutVars{~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[387] L49-1-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_1| |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_1| v_~counter~0_1)) InVars {~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[389] L49-2-->L49-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[390] L49-3-->L100: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[391] L100-->L100-1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_3| |v_thread1Thread1of1ForFork0_plus_~a#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_3|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1]" "[392] L100-1-->L101: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_3| |v_thread1Thread1of1ForFork0_plus_~b#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~b#1]" "[393] L101-->L101-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[394] L101-1-->L35: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[395] L35-->L36: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[397] L36-->L35-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[399] L35-1-->L101-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[400] L101-2-->L102: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[401] L102-->L102-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_7| |v_thread1Thread1of1ForFork0_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_7| 0)) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[402] L102-1-->L35-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[403] L35-2-->L36-3: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[405] L36-3-->L35-3: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[407] L35-3-->L102-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[408] L102-2-->L103: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[409] L103-->plus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_3| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_9| |v_thread1Thread1of1ForFork0_plus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[410] plus_returnLabel#1-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[411] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_11|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[412] L49-5-->L49-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[413] L49-6-->L49-7: Formula: (= |v_thread1Thread1of1ForFork0_~tmp~0#1_1| |v_thread1Thread1of1ForFork0_#t~ret2#1_3|) InVars {thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_1|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[414] L49-7-->L49-8: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[415] L49-8-->L50: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[416] L50-->L50-1: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork0_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} OutVars{~counter~0=v_~counter~0_2, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} AuxVars[] AssignedVars[~counter~0]" "[417] L50-1-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[418] L48-2-->L48-3: Formula: (= |v_thread1Thread1of1ForFork0_#t~post3#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" "[419] L48-3-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_13| (+ |v_thread1Thread1of1ForFork0_#t~post3#1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[420] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" [2025-04-26 16:11:42,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1744760997, now seen corresponding path program 1 times [2025-04-26 16:11:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:42,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573939602] [2025-04-26 16:11:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:11:43,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:11:43,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:43,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:11:43,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:11:43,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:43,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash -408419568, now seen corresponding path program 1 times [2025-04-26 16:11:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:43,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520810128] [2025-04-26 16:11:43,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:43,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:43,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:43,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:43,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:43,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1144752246, now seen corresponding path program 1 times [2025-04-26 16:11:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:43,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311160258] [2025-04-26 16:11:43,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:11:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:11:43,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:11:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:11:43,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311160258] [2025-04-26 16:11:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311160258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:11:43,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:11:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:11:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202702962] [2025-04-26 16:11:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:11:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:11:43,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:11:43,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:11:43,487 INFO L87 Difference]: Start difference. First operand 4840 states and 13118 transitions. cyclomatic complexity: 8325 Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (in total 81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:11:43,641 INFO L93 Difference]: Finished difference Result 5704 states and 14739 transitions. [2025-04-26 16:11:43,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5704 states and 14739 transitions. [2025-04-26 16:11:43,671 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 5270 [2025-04-26 16:11:43,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5704 states to 5562 states and 14381 transitions. [2025-04-26 16:11:43,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5550 [2025-04-26 16:11:43,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5550 [2025-04-26 16:11:43,728 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5562 states and 14381 transitions. [2025-04-26 16:11:43,738 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:11:43,738 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5562 states and 14381 transitions. [2025-04-26 16:11:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states and 14381 transitions. [2025-04-26 16:11:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5104. [2025-04-26 16:11:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5104 states, 5104 states have (on average 2.6079545454545454) internal successors, (in total 13311), 5103 states have internal predecessors, (13311), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 13311 transitions. [2025-04-26 16:11:43,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5104 states and 13311 transitions. [2025-04-26 16:11:43,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:11:43,859 INFO L438 stractBuchiCegarLoop]: Abstraction has 5104 states and 13311 transitions. [2025-04-26 16:11:43,859 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:11:43,859 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5104 states and 13311 transitions. [2025-04-26 16:11:43,878 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 4867 [2025-04-26 16:11:43,878 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:43,878 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:43,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:43,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:43,880 INFO L752 eck$LassoCheckResult]: Stem: "[241] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[249] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[321] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[263] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[312] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[280] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[326] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[237] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[364] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[367] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[246] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[275] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[362] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[318] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[299] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[227] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[368] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[328] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[232] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[363] L84-1-->L35: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[352] L35-->L36: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[361] L36-->L35-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[341] L35-1-->L84-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[238] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[248] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[267] L85-1-->L35-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] L35-2-->L36-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[298] L36-3-->L35-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[219] L35-3-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[214] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[270] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[220] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[215] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[319] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[334] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[300] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[233] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[347] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[245] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[213] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[264] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[371] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[283] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[287] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[217] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[464] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[369] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[294] L72-5-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[323] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[344] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[243] L73-2-->L73-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[467] L73-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_14|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_16|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_8|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_14|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_22|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_8|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_8|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_8|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_8|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_4|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[421] $Ultimate##0-->L57: Formula: (and (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork1_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork1_~_argptr#1.offset_1| |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base]" "[422] L57-->L57-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" [2025-04-26 16:11:43,881 INFO L754 eck$LassoCheckResult]: Loop: "[424] L57-5-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[426] L58-->L58-1: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_2))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_2 4) (select |v_#length_2| v_~A~0.base_2)) (= (select (select |v_#memory_int_2| v_~A~0.base_2) .cse0) |v_thread2Thread1of1ForFork1_#t~mem4#1_1|) (= (select |v_#valid_2| v_~A~0.base_2) 1)))) InVars {#memory_int=|v_#memory_int_2|, ~A~0.base=v_~A~0.base_2, #length=|v_#length_2|, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|, #valid=|v_#valid_2|} OutVars{~A~0.base=v_~A~0.base_2, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[428] L58-1-->L58-2: Formula: (and (= v_~counter~0_4 |v_thread2Thread1of1ForFork1_minus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|, ~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_4, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_1|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_1|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[430] L58-2-->L58-3: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[431] L58-3-->L94: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_1|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[432] L94-->L94-1: Formula: (= |v_thread2Thread1of1ForFork1_minus_~a#1_3| |v_thread2Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_3|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1]" "[433] L94-1-->L95: Formula: (= |v_thread2Thread1of1ForFork1_minus_~b#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1]" "[434] L95-->L95-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[435] L95-1-->L35: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[436] L35-->L36: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[438] L36-->L35-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[440] L35-1-->L95-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[441] L95-2-->L96: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[442] L96-->L96-1: Formula: (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_7|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[443] L96-1-->L35-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[444] L35-2-->L36-3: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[446] L36-3-->L35-3: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[448] L35-3-->L96-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[449] L96-2-->L97: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[450] L97-->minus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_3| |v_thread2Thread1of1ForFork1_minus_~b#1_9|) |v_thread2Thread1of1ForFork1_minus_~a#1_9|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[451] minus_returnLabel#1-->L58-4: Formula: (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_#t~ret5#1_1|) InVars {thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[452] L58-4-->L58-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_11|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[453] L58-5-->L58-6: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[454] L58-6-->L58-7: Formula: (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_#t~ret5#1_3|) InVars {thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[455] L58-7-->L58-8: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[456] L58-8-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[457] L59-->L59-1: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork1_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} OutVars{~counter~0=v_~counter~0_3, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} AuxVars[] AssignedVars[~counter~0]" "[458] L59-1-->L57-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[459] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~post6#1_1| |v_thread2Thread1of1ForFork1_~i~1#1_11|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" "[460] L57-3-->L57-4: Formula: (= (+ |v_thread2Thread1of1ForFork1_#t~post6#1_3| 1) |v_thread2Thread1of1ForFork1_~i~1#1_13|) InVars {thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" "[461] L57-4-->L57-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" [2025-04-26 16:11:43,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -398968763, now seen corresponding path program 1 times [2025-04-26 16:11:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:43,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62088676] [2025-04-26 16:11:43,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 16:11:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 16:11:43,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 16:11:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 16:11:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:43,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1437574567, now seen corresponding path program 1 times [2025-04-26 16:11:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:43,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657828661] [2025-04-26 16:11:43,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:43,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:43,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:43,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:43,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:43,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:43,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:43,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1977751957, now seen corresponding path program 1 times [2025-04-26 16:11:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:43,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668420413] [2025-04-26 16:11:43,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:43,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 16:11:43,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 16:11:43,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:43,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:11:44,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:11:44,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668420413] [2025-04-26 16:11:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668420413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:11:44,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:11:44,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:11:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104222449] [2025-04-26 16:11:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:11:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:11:44,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:11:44,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:11:44,234 INFO L87 Difference]: Start difference. First operand 5104 states and 13311 transitions. cyclomatic complexity: 8275 Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (in total 87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:11:44,357 INFO L93 Difference]: Finished difference Result 4902 states and 12709 transitions. [2025-04-26 16:11:44,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4902 states and 12709 transitions. [2025-04-26 16:11:44,380 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 4588 [2025-04-26 16:11:44,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4902 states to 4783 states and 12476 transitions. [2025-04-26 16:11:44,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4771 [2025-04-26 16:11:44,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4771 [2025-04-26 16:11:44,415 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4783 states and 12476 transitions. [2025-04-26 16:11:44,425 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:11:44,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4783 states and 12476 transitions. [2025-04-26 16:11:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states and 12476 transitions. [2025-04-26 16:11:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4778. [2025-04-26 16:11:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4778 states have (on average 2.6100879028882376) internal successors, (in total 12471), 4777 states have internal predecessors, (12471), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 12471 transitions. [2025-04-26 16:11:44,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4778 states and 12471 transitions. [2025-04-26 16:11:44,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:11:44,528 INFO L438 stractBuchiCegarLoop]: Abstraction has 4778 states and 12471 transitions. [2025-04-26 16:11:44,528 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:11:44,528 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4778 states and 12471 transitions. [2025-04-26 16:11:44,574 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 4588 [2025-04-26 16:11:44,574 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:44,574 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:44,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:44,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:44,577 INFO L752 eck$LassoCheckResult]: Stem: "[241] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[249] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[321] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[263] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[312] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[280] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[326] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[237] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[364] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[367] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[246] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[275] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[362] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[318] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[299] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[227] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[368] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[328] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[232] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[363] L84-1-->L35: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[352] L35-->L36: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[361] L36-->L35-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[341] L35-1-->L84-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[238] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[248] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[267] L85-1-->L35-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] L35-2-->L36-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[298] L36-3-->L35-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[219] L35-3-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[214] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[270] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[220] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[215] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[319] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[335] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[291] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[266] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[311] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[226] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[289] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[376] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[334] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[300] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[233] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[347] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[245] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[213] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[264] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[371] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[283] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[287] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[217] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[464] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[380] $Ultimate##0-->L48: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[381] L48-->L48-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" [2025-04-26 16:11:44,577 INFO L754 eck$LassoCheckResult]: Loop: "[383] L48-5-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[385] L49-->L49-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_1))) (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_1| (select (select |v_#memory_int_1| v_~A~0.base_1) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {#memory_int=|v_#memory_int_1|, ~A~0.base=v_~A~0.base_1, #length=|v_#length_1|, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|} OutVars{~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[387] L49-1-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_1| |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_1| v_~counter~0_1)) InVars {~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{~counter~0=v_~counter~0_1, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[389] L49-2-->L49-3: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[390] L49-3-->L100: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[391] L100-->L100-1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_3| |v_thread1Thread1of1ForFork0_plus_~a#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_3|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1]" "[392] L100-1-->L101: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_3| |v_thread1Thread1of1ForFork0_plus_~b#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~b#1]" "[393] L101-->L101-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[394] L101-1-->L35: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[395] L35-->L36: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[397] L36-->L35-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[399] L35-1-->L101-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[400] L101-2-->L102: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[401] L102-->L102-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_7| |v_thread1Thread1of1ForFork0_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_7| 0)) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[402] L102-1-->L35-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[403] L35-2-->L36-3: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[405] L36-3-->L35-3: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[407] L35-3-->L102-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[408] L102-2-->L103: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[409] L103-->plus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_3| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_9| |v_thread1Thread1of1ForFork0_plus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[410] plus_returnLabel#1-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[411] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_11|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[412] L49-5-->L49-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[413] L49-6-->L49-7: Formula: (= |v_thread1Thread1of1ForFork0_~tmp~0#1_1| |v_thread1Thread1of1ForFork0_#t~ret2#1_3|) InVars {thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_1|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[414] L49-7-->L49-8: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1]" "[415] L49-8-->L50: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[416] L50-->L50-1: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork0_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} OutVars{~counter~0=v_~counter~0_2, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_3|} AuxVars[] AssignedVars[~counter~0]" "[417] L50-1-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1]" "[418] L48-2-->L48-3: Formula: (= |v_thread1Thread1of1ForFork0_#t~post3#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" "[419] L48-3-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_13| (+ |v_thread1Thread1of1ForFork0_#t~post3#1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[420] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" [2025-04-26 16:11:44,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1649274475, now seen corresponding path program 1 times [2025-04-26 16:11:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:44,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213213904] [2025-04-26 16:11:44,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:44,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:11:44,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:11:44,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:11:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:11:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:44,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -408419568, now seen corresponding path program 2 times [2025-04-26 16:11:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:44,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160658870] [2025-04-26 16:11:44,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:11:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:44,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:44,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:44,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:11:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:44,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:44,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:44,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:44,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1156135066, now seen corresponding path program 1 times [2025-04-26 16:11:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:44,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149184586] [2025-04-26 16:11:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:44,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:11:44,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:11:44,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:44,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:11:44,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:11:44,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:44,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:44,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:45,169 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:11:45,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:11:45,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:11:45,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:11:45,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:11:45,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:11:45,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:11:45,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration4_Lasso [2025-04-26 16:11:45,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:11:45,169 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:11:45,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:45,848 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:11:45,848 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:11:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:11:45,855 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 [2025-04-26 16:11:45,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,867 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:11:45,878 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 [2025-04-26 16:11:45,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,889 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:45,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,896 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:11:45,898 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 [2025-04-26 16:11:45,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:11:45,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,916 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:11:45,917 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 [2025-04-26 16:11:45,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,928 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:11:45,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:11:45,937 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 [2025-04-26 16:11:45,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,948 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:11:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,955 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:11:45,958 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 [2025-04-26 16:11:45,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,968 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,975 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:11:45,977 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 [2025-04-26 16:11:45,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:45,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:45,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:45,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:45,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:45,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:45,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:45,988 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:45,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:11:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:45,995 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:45,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:11:45,996 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 [2025-04-26 16:11:46,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,010 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:11:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,017 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:11:46,019 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 [2025-04-26 16:11:46,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:11:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,040 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:11:46,042 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 [2025-04-26 16:11:46,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,055 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:11:46,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,063 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:11:46,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:46,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,086 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:11:46,088 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 [2025-04-26 16:11:46,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,106 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:11:46,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 [2025-04-26 16:11:46,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:11:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,127 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:11:46,129 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 [2025-04-26 16:11:46,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,181 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:11:46,183 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 [2025-04-26 16:11:46,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,194 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:11:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,201 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:11:46,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:46,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:11:46,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,220 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:11:46,222 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 [2025-04-26 16:11:46,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,233 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:11:46,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,240 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:11:46,242 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 [2025-04-26 16:11:46,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,253 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:11:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,260 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:11:46,261 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 [2025-04-26 16:11:46,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,273 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:11:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,280 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:11:46,282 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 [2025-04-26 16:11:46,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:11:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,302 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:11:46,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 [2025-04-26 16:11:46,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,317 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:11:46,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,324 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:11:46,326 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 [2025-04-26 16:11:46,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,337 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,344 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:11:46,346 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 [2025-04-26 16:11:46,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,357 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,364 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:11:46,366 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 [2025-04-26 16:11:46,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,376 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:11:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,383 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:11:46,385 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 [2025-04-26 16:11:46,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,399 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,407 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:11:46,409 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 [2025-04-26 16:11:46,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:11:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,432 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:11:46,433 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 [2025-04-26 16:11:46,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:46,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:46,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:46,445 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,452 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:11:46,454 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 [2025-04-26 16:11:46,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:11:46,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,475 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:11:46,476 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 [2025-04-26 16:11:46,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:46,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:11:46,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,497 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:11:46,498 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 [2025-04-26 16:11:46,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:46,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:46,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:46,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:46,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:46,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:46,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:11:46,536 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:11:46,536 INFO L437 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:11:46,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:46,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:46,538 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:46,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:11:46,539 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:11:46,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:11:46,556 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:11:46,556 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:11:46,556 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~A~0.base)_1, thread1Thread1of1ForFork0_~i~0#1) = 1*v_rep(select #length ~A~0.base)_1 - 4*thread1Thread1of1ForFork0_~i~0#1 Supporting invariants [1*~A~0.offset >= 0] [2025-04-26 16:11:46,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:11:46,585 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-04-26 16:11:46,586 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:11:46,586 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:11:46,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:46,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:11:46,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:11:46,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:46,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:46,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:11:46,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:46,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:46,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:46,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:46,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:46,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:11:46,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:11:46,956 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:11:46,956 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4778 states and 12471 transitions. cyclomatic complexity: 7752 Second operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:47,258 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4778 states and 12471 transitions. cyclomatic complexity: 7752. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9621 states and 26068 transitions. Complement of second has 17 states. [2025-04-26 16:11:47,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:11:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 8.0) internal successors, (in total 88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 329 transitions. [2025-04-26 16:11:47,260 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 329 transitions. Stem has 57 letters. Loop has 31 letters. [2025-04-26 16:11:47,262 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:47,262 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 329 transitions. Stem has 88 letters. Loop has 31 letters. [2025-04-26 16:11:47,263 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:47,263 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 329 transitions. Stem has 57 letters. Loop has 62 letters. [2025-04-26 16:11:47,263 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:47,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9621 states and 26068 transitions. [2025-04-26 16:11:47,305 INFO L131 ngComponentsAnalysis]: Automaton has 118 accepting balls. 3658 [2025-04-26 16:11:47,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9621 states to 8064 states and 21745 transitions. [2025-04-26 16:11:47,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4279 [2025-04-26 16:11:47,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4698 [2025-04-26 16:11:47,344 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8064 states and 21745 transitions. [2025-04-26 16:11:47,344 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:11:47,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8064 states and 21745 transitions. [2025-04-26 16:11:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states and 21745 transitions. [2025-04-26 16:11:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7647. [2025-04-26 16:11:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7647 states, 7647 states have (on average 2.68641297240748) internal successors, (in total 20543), 7646 states have internal predecessors, (20543), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7647 states to 7647 states and 20543 transitions. [2025-04-26 16:11:47,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7647 states and 20543 transitions. [2025-04-26 16:11:47,480 INFO L438 stractBuchiCegarLoop]: Abstraction has 7647 states and 20543 transitions. [2025-04-26 16:11:47,480 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:11:47,480 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7647 states and 20543 transitions. [2025-04-26 16:11:47,502 INFO L131 ngComponentsAnalysis]: Automaton has 118 accepting balls. 3658 [2025-04-26 16:11:47,502 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:11:47,502 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:11:47,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:47,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:11:47,505 INFO L752 eck$LassoCheckResult]: Stem: "[241] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_6| 0) 0) InVars {#valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|} AuxVars[] AssignedVars[]" "[249] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[321] L21-->L21-1: Formula: (and (= (select |v_#length_6| 1) 2) (= (select |v_#valid_7| 1) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[350] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[]" "[263] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[312] L21-3-->L21-4: Formula: (and (= (select |v_#length_7| 2) 31) (= (select |v_#valid_8| 2) 1)) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[280] L21-4-->L40: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[326] L40-->L41: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0]" "[237] L41-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[364] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[367] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_5|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_~t2~0#1]" "[246] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[275] L66-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[362] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[318] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[299] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[227] L69-->L69-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[368] L69-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[328] L69-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[232] L83-->L84: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[353] L84-->L84-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_2|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[363] L84-1-->L35: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[352] L35-->L36: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[361] L36-->L35-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[341] L35-1-->L84-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[238] L84-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[248] L85-->L85-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[267] L85-1-->L35-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[306] L35-2-->L36-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[298] L36-3-->L35-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[219] L35-3-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[214] L85-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[270] L87-->L87-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 1073741824) 4)) |v_#length_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[220] L87-1-->L87-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[215] L87-2-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base]" "[319] L88-->L88-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[335] L88-5-->L89: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[]" "[291] L89-->L89-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[266] L89-1-->L89-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse0 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|)) |v_#memory_int_3|) (<= 0 .cse1) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[#memory_int]" "[311] L89-2-->L88-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet14#1]" "[226] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[289] L88-3-->L88-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[376] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1]" "[334] L88-5-->L88-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[]" "[300] L88-6-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1]" "[233] L91-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[347] create_fresh_int_array_returnLabel#1-->L69-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[245] L69-3-->L69-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet14#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1]" "[213] L69-4-->L69-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[264] L69-5-->L69-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[371] L69-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base]" "[283] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[287] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[217] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[464] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_16|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_22|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[369] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[294] L72-5-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[323] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[344] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[243] L73-2-->L73-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre11#1_2|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[467] L73-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_14|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_14|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_16|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_8|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_14|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_22|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_8|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_8|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_8|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_8|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_4|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[421] $Ultimate##0-->L57: Formula: (and (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork1_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork1_~_argptr#1.offset_1| |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base]" "[422] L57-->L57-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" [2025-04-26 16:11:47,505 INFO L754 eck$LassoCheckResult]: Loop: "[424] L57-5-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[426] L58-->L58-1: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_9| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_2))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_2 4) (select |v_#length_2| v_~A~0.base_2)) (= (select (select |v_#memory_int_2| v_~A~0.base_2) .cse0) |v_thread2Thread1of1ForFork1_#t~mem4#1_1|) (= (select |v_#valid_2| v_~A~0.base_2) 1)))) InVars {#memory_int=|v_#memory_int_2|, ~A~0.base=v_~A~0.base_2, #length=|v_#length_2|, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|, #valid=|v_#valid_2|} OutVars{~A~0.base=v_~A~0.base_2, ~A~0.offset=v_~A~0.offset_2, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[428] L58-1-->L58-2: Formula: (and (= v_~counter~0_4 |v_thread2Thread1of1ForFork1_minus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|, ~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_4, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_1|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_1|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[430] L58-2-->L58-3: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[431] L58-3-->L94: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_1|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[432] L94-->L94-1: Formula: (= |v_thread2Thread1of1ForFork1_minus_~a#1_3| |v_thread2Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_3|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1]" "[433] L94-1-->L95: Formula: (= |v_thread2Thread1of1ForFork1_minus_~b#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1]" "[434] L95-->L95-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[435] L95-1-->L35: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[436] L35-->L36: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[438] L36-->L35-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[440] L35-1-->L95-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[441] L95-2-->L96: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[442] L96-->L96-1: Formula: (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_7|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[443] L96-1-->L35-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[444] L35-2-->L36-3: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[446] L36-3-->L35-3: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[448] L35-3-->L96-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[449] L96-2-->L97: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[450] L97-->minus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_3| |v_thread2Thread1of1ForFork1_minus_~b#1_9|) |v_thread2Thread1of1ForFork1_minus_~a#1_9|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[451] minus_returnLabel#1-->L58-4: Formula: (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_#t~ret5#1_1|) InVars {thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[452] L58-4-->L58-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_11|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[453] L58-5-->L58-6: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[454] L58-6-->L58-7: Formula: (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_#t~ret5#1_3|) InVars {thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[455] L58-7-->L58-8: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4#1]" "[456] L58-8-->L59: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[457] L59-->L59-1: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork1_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} OutVars{~counter~0=v_~counter~0_3, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_3|} AuxVars[] AssignedVars[~counter~0]" "[458] L59-1-->L57-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~tmp~1#1]" "[459] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~post6#1_1| |v_thread2Thread1of1ForFork1_~i~1#1_11|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" "[460] L57-3-->L57-4: Formula: (= (+ |v_thread2Thread1of1ForFork1_#t~post6#1_3| 1) |v_thread2Thread1of1ForFork1_~i~1#1_13|) InVars {thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" "[461] L57-4-->L57-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" [2025-04-26 16:11:47,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1517974699, now seen corresponding path program 1 times [2025-04-26 16:11:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:47,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26170090] [2025-04-26 16:11:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:47,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:11:47,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:11:47,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:47,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:11:47,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:11:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:47,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1437574567, now seen corresponding path program 2 times [2025-04-26 16:11:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:47,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329060499] [2025-04-26 16:11:47,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:11:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:47,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:47,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:47,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:11:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:47,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:47,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:47,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:47,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:47,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1991140485, now seen corresponding path program 1 times [2025-04-26 16:11:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:11:47,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30075083] [2025-04-26 16:11:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:11:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:11:47,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-26 16:11:47,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-26 16:11:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:11:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-26 16:11:47,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-26 16:11:47,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:47,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:11:47,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:11:48,244 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:11:48,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:11:48,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:11:48,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:11:48,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:11:48,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:11:48,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:11:48,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_petrified1_Iteration5_Lasso [2025-04-26 16:11:48,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:11:48,244 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:11:48,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:11:48,905 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:11:48,905 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:11:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:48,907 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:48,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:11:48,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:48,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:48,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:48,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:48,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:48,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:48,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:48,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:48,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:48,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:48,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:48,929 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:48,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:11:48,931 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 [2025-04-26 16:11:48,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:48,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:48,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:48,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:48,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:48,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:48,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:48,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:48,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:48,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:48,949 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:48,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:11:48,950 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 [2025-04-26 16:11:48,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:48,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:48,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:48,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:48,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:48,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:48,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:48,961 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:48,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:11:48,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:48,968 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:48,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:11:48,970 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 [2025-04-26 16:11:48,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:48,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:48,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:48,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:48,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:48,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:48,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:48,981 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:48,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:11:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:48,987 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:48,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:11:48,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:48,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:48,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:48,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:48,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:48,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:48,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,001 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:11:49,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,008 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:11:49,010 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 [2025-04-26 16:11:49,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,021 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:49,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,028 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:11:49,030 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 [2025-04-26 16:11:49,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:49,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,048 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:11:49,049 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 [2025-04-26 16:11:49,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,059 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:11:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,066 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:11:49,068 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 [2025-04-26 16:11:49,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,080 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:11:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,086 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:11:49,088 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 [2025-04-26 16:11:49,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,101 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:11:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,108 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:11:49,109 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 [2025-04-26 16:11:49,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:11:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,127 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:11:49,129 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 [2025-04-26 16:11:49,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,140 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:11:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,147 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:11:49,149 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 [2025-04-26 16:11:49,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:11:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,167 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:11:49,168 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 [2025-04-26 16:11:49,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,179 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:11:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,185 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:11:49,187 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 [2025-04-26 16:11:49,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:11:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,205 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:11:49,206 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 [2025-04-26 16:11:49,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:11:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,224 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:11:49,226 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 [2025-04-26 16:11:49,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:11:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,244 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:11:49,245 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 [2025-04-26 16:11:49,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,258 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:11:49,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,265 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:11:49,267 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 [2025-04-26 16:11:49,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,279 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:49,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,286 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:11:49,288 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 [2025-04-26 16:11:49,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,300 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:11:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,307 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:11:49,308 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 [2025-04-26 16:11:49,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,319 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:11:49,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,326 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:11:49,327 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 [2025-04-26 16:11:49,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,339 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:11:49,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,346 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:11:49,347 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 [2025-04-26 16:11:49,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,358 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 16:11:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,365 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:11:49,381 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 [2025-04-26 16:11:49,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,393 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:11:49,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,400 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:11:49,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:49,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:11:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,419 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:11:49,420 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 [2025-04-26 16:11:49,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,431 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:11:49,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,438 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:11:49,441 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 [2025-04-26 16:11:49,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,452 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,459 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:11:49,460 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 [2025-04-26 16:11:49,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:11:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,478 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:11:49,479 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 [2025-04-26 16:11:49,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:11:49,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,497 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:11:49,499 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 [2025-04-26 16:11:49,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:11:49,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,517 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:11:49,518 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 [2025-04-26 16:11:49,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,529 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 16:11:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,537 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:11:49,538 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 [2025-04-26 16:11:49,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,550 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:11:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,557 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:11:49,558 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 [2025-04-26 16:11:49,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,569 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:11:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,577 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:11:49,579 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 [2025-04-26 16:11:49,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:11:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,596 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:11:49,597 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 [2025-04-26 16:11:49,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,608 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:11:49,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,615 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:11:49,616 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 [2025-04-26 16:11:49,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,628 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:11:49,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,635 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:11:49,636 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 [2025-04-26 16:11:49,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:11:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,654 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:11:49,655 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 [2025-04-26 16:11:49,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:11:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,673 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:11:49,674 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 [2025-04-26 16:11:49,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,686 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:11:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,693 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:11:49,695 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 [2025-04-26 16:11:49,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:11:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,712 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:11:49,713 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 [2025-04-26 16:11:49,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 16:11:49,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,737 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:11:49,738 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 [2025-04-26 16:11:49,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,749 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-04-26 16:11:49,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,755 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:11:49,758 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 [2025-04-26 16:11:49,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,768 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-04-26 16:11:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,775 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:11:49,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:49,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,787 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:11:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,794 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:11:49,795 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 [2025-04-26 16:11:49,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-04-26 16:11:49,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,812 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:11:49,814 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 [2025-04-26 16:11:49,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,825 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 16:11:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,831 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:11:49,833 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 [2025-04-26 16:11:49,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:11:49,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:11:49,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:11:49,843 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:11:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,850 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:11:49,851 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 [2025-04-26 16:11:49,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 16:11:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,871 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:11:49,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:11:49,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,885 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:11:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,891 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:11:49,893 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 [2025-04-26 16:11:49,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,905 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:11:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,912 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:11:49,914 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 [2025-04-26 16:11:49,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-04-26 16:11:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,933 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:11:49,935 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 [2025-04-26 16:11:49,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,947 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:11:49,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:11:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,954 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:11:49,956 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 [2025-04-26 16:11:49,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:11:49,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:11:49,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:11:49,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:11:49,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:11:49,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:11:49,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:11:49,989 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:11:49,989 INFO L437 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-04-26 16:11:49,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:11:49,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:11:49,991 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:11:49,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:11:49,993 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:11:50,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-04-26 16:11:50,008 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:11:50,008 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:11:50,008 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_~i~1#1, ~N~0) = -1*thread2Thread1of1ForFork1_~i~1#1 + 1*~N~0 Supporting invariants [] [2025-04-26 16:11:50,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 16:11:50,030 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-04-26 16:11:50,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:11:50,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:11:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:11:50,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:50,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:50,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:11:50,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:11:50,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:11:50,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:11:50,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:11:50,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:11:50,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:11:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:11:50,220 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:11:50,220 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7647 states and 20543 transitions. cyclomatic complexity: 13030 Second operand has 5 states, 5 states have (on average 18.8) internal successors, (in total 94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:50,373 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7647 states and 20543 transitions. cyclomatic complexity: 13030. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (in total 94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18589 states and 51696 transitions. Complement of second has 8 states. [2025-04-26 16:11:50,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:11:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (in total 94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:11:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2025-04-26 16:11:50,374 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 306 transitions. Stem has 63 letters. Loop has 31 letters. [2025-04-26 16:11:50,374 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:50,375 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 306 transitions. Stem has 94 letters. Loop has 31 letters. [2025-04-26 16:11:50,375 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:50,375 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 306 transitions. Stem has 63 letters. Loop has 62 letters. [2025-04-26 16:11:50,375 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:11:50,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18589 states and 51696 transitions. [2025-04-26 16:11:50,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:11:50,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18589 states to 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:11:50,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:11:50,463 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:11:50,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:11:50,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:11:50,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:11:50,463 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:11:50,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:11:50 BoogieIcfgContainer [2025-04-26 16:11:50,469 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:11:50,470 INFO L158 Benchmark]: Toolchain (without parser) took 10980.61ms. Allocated memory was 155.2MB in the beginning and 520.1MB in the end (delta: 364.9MB). Free memory was 108.6MB in the beginning and 127.9MB in the end (delta: -19.3MB). Peak memory consumption was 343.5MB. Max. memory is 8.0GB. [2025-04-26 16:11:50,470 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 85.1MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:11:50,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.62ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 94.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:11:50,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.12ms. Allocated memory is still 155.2MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:11:50,471 INFO L158 Benchmark]: Boogie Preprocessor took 20.73ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 92.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:11:50,471 INFO L158 Benchmark]: RCFGBuilder took 308.46ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 75.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:11:50,471 INFO L158 Benchmark]: BuchiAutomizer took 10373.97ms. Allocated memory was 155.2MB in the beginning and 520.1MB in the end (delta: 364.9MB). Free memory was 75.2MB in the beginning and 127.9MB in the end (delta: -52.7MB). Peak memory consumption was 314.1MB. Max. memory is 8.0GB. [2025-04-26 16:11:50,472 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 85.1MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.62ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 94.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.12ms. Allocated memory is still 155.2MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.73ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 92.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 308.46ms. Allocated memory is still 155.2MB. Free memory was 92.0MB in the beginning and 75.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 10373.97ms. Allocated memory was 155.2MB in the beginning and 520.1MB in the end (delta: 364.9MB). Free memory was 75.2MB in the beginning and 127.9MB in the end (delta: -52.7MB). Peak memory consumption was 314.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 881 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 2967 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 857 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax115 hnf100 lsp75 ukn79 mio100 lsp38 div187 bol100 ite100 ukn100 eq147 hnf94 smp66 dnf120 smp84 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function null and consists of 13 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:11:50,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...