/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:32:18,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:32:18,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:32:18,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:32:18,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:32:18,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:32:18,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:32:18,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:32:18,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:32:18,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:32:18,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:32:18,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:32:18,595 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:32:18,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:32:18,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:32:18,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:32:18,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:32:18,596 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:32:18,596 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:32:18,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:32:18,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:32:18,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:32:18,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:32:18,834 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:32:18,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-26 18:32:20,083 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38a60524c/c1e93bfc3d364806a5f31c91a88cd2e9/FLAG843852122 [2025-04-26 18:32:20,306 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:32:20,307 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-26 18:32:20,315 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38a60524c/c1e93bfc3d364806a5f31c91a88cd2e9/FLAG843852122 [2025-04-26 18:32:21,083 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/38a60524c/c1e93bfc3d364806a5f31c91a88cd2e9 [2025-04-26 18:32:21,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:32:21,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:32:21,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:32:21,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:32:21,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:32:21,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be05004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21, skipping insertion in model container [2025-04-26 18:32:21,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:32:21,233 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-26 18:32:21,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:32:21,246 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:32:21,269 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-26 18:32:21,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:32:21,284 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:32:21,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21 WrapperNode [2025-04-26 18:32:21,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:32:21,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:32:21,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:32:21,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:32:21,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,308 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 131 [2025-04-26 18:32:21,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:32:21,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:32:21,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:32:21,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:32:21,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:32:21,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:32:21,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:32:21,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:32:21,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (1/1) ... [2025-04-26 18:32:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:32:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:21,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:32:21,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:32:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:32:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:32:21,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:32:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:32:21,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:32:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:32:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 18:32:21,393 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 18:32:21,476 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:32:21,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:32:21,665 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:32:21,666 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:32:21,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:32:21,749 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 18:32:21,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:32:21 BoogieIcfgContainer [2025-04-26 18:32:21,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:32:21,750 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:32:21,750 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:32:21,755 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:32:21,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:32:21,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:32:21" (1/3) ... [2025-04-26 18:32:21,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bf96fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:32:21, skipping insertion in model container [2025-04-26 18:32:21,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:32:21,757 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:32:21" (2/3) ... [2025-04-26 18:32:21,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bf96fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:32:21, skipping insertion in model container [2025-04-26 18:32:21,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:32:21,757 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:32:21" (3/3) ... [2025-04-26 18:32:21,758 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-04-26 18:32:21,804 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:32:21,831 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:32:21,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:32:21,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:21,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:32:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:32:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 129 transitions, 272 flow [2025-04-26 18:32:21,930 INFO L116 PetriNetUnfolderBase]: 10/125 cut-off events. [2025-04-26 18:32:21,932 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:32:21,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 125 events. 10/125 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2025-04-26 18:32:21,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 129 transitions, 272 flow [2025-04-26 18:32:21,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 125 transitions, 262 flow [2025-04-26 18:32:21,938 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 122 places, 125 transitions, 262 flow [2025-04-26 18:32:21,939 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 125 transitions, 262 flow [2025-04-26 18:32:21,992 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 788 states, 786 states have (on average 2.6526717557251906) internal successors, (in total 2085), 787 states have internal predecessors, (2085), 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 18:32:21,993 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 788 states, 786 states have (on average 2.6526717557251906) internal successors, (in total 2085), 787 states have internal predecessors, (2085), 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 18:32:21,995 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:32:22,119 WARN L140 AmpleReduction]: Number of pruned transitions: 402 [2025-04-26 18:32:22,119 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:32:22,119 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 24 [2025-04-26 18:32:22,119 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:117 [2025-04-26 18:32:22,119 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:280 [2025-04-26 18:32:22,119 WARN L145 AmpleReduction]: Times succ was already a loop node:12 [2025-04-26 18:32:22,119 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:30 [2025-04-26 18:32:22,119 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:32:22,120 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 422 states, 420 states have (on average 1.3095238095238095) internal successors, (in total 550), 421 states have internal predecessors, (550), 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 18:32:22,129 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:32:22,129 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:32:22,129 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:32:22,129 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:32:22,129 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:32:22,129 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:32:22,129 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:32:22,129 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:32:22,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 422 states, 420 states have (on average 1.3095238095238095) internal successors, (in total 550), 421 states have internal predecessors, (550), 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 18:32:22,154 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 263 [2025-04-26 18:32:22,155 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:22,155 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:22,159 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] [2025-04-26 18:32:22,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:22,159 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:32:22,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 422 states, 420 states have (on average 1.3095238095238095) internal successors, (in total 550), 421 states have internal predecessors, (550), 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 18:32:22,165 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 263 [2025-04-26 18:32:22,165 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:22,165 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:22,166 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] [2025-04-26 18:32:22,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:22,175 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" [2025-04-26 18:32:22,176 INFO L754 eck$LassoCheckResult]: Loop: "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" [2025-04-26 18:32:22,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 614663735, now seen corresponding path program 1 times [2025-04-26 18:32:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:22,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168452464] [2025-04-26 18:32:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:22,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:32:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:32:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:22,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:32:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:32:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:22,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2130956473, now seen corresponding path program 1 times [2025-04-26 18:32:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:22,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869837593] [2025-04-26 18:32:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:32:22,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:32:22,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:22,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:32:22,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:32:22,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:22,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1618616239, now seen corresponding path program 1 times [2025-04-26 18:32:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:22,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612699266] [2025-04-26 18:32:22,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:22,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 18:32:22,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 18:32:22,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 18:32:22,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 18:32:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:22,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:22,727 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:32:22,728 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:32:22,728 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:32:22,728 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:32:22,728 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:32:22,728 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:22,728 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:32:22,728 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:32:22,728 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 18:32:22,728 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:32:22,728 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:32:22,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:22,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:23,314 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:32:23,317 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:32:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,320 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 18:32:23,322 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 18:32:23,323 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 18:32:23,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:23,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:23,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:23,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,354 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 18:32:23,356 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 18:32:23,357 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 18:32:23,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,377 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,387 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 18:32:23,388 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 18:32:23,390 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 18:32:23,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,405 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,413 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 18:32:23,414 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 18:32:23,416 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 18:32:23,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,431 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:23,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,439 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 18:32:23,440 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 18:32:23,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:32:23,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:23,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,470 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 18:32:23,472 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 18:32:23,473 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 18:32:23,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,488 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,494 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 18:32:23,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,496 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 18:32:23,498 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 18:32:23,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 18:32:23,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:32:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,526 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 18:32:23,526 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 18:32:23,527 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 18:32:23,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,542 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:32:23,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,550 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 18:32:23,552 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 18:32:23,553 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 18:32:23,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,568 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,574 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 18:32:23,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,576 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 18:32:23,577 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 18:32:23,578 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 18:32:23,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,588 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:32:23,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:32:23,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,593 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,598 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 18:32:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,600 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 18:32:23,601 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 18:32:23,602 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 18:32:23,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:23,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:23,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:23,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:23,619 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 18:32:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,621 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 18:32:23,621 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 18:32:23,623 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 18:32:23,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:23,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:23,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:23,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:23,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:23,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:23,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:32:23,662 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:32:23,662 INFO L437 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 18:32:23,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:23,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:23,665 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 18:32:23,666 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 18:32:23,667 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:32:23,688 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 18:32:23,688 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:32:23,688 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:32:23,689 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2025-04-26 18:32:23,696 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 18:32:23,708 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 18:32:23,713 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 18:32:23,714 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 18:32:23,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:23,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:32:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:32:23,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:23,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:32:23,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:23,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:32:23,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:32:23,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:23,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:23,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:32:23,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:23,956 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 18:32:23,971 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 18:32:23,973 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 422 states, 420 states have (on average 1.3095238095238095) internal successors, (in total 550), 421 states have internal predecessors, (550), 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) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (in total 50), 8 states have internal predecessors, (50), 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 18:32:24,109 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 422 states, 420 states have (on average 1.3095238095238095) internal successors, (in total 550), 421 states have internal predecessors, (550), 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). Second operand has 8 states, 8 states have (on average 6.25) internal successors, (in total 50), 8 states have internal predecessors, (50), 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 823 states and 1081 transitions. Complement of second has 13 states. [2025-04-26 18:32:24,110 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 18:32:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (in total 50), 8 states have internal predecessors, (50), 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 18:32:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2025-04-26 18:32:24,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 149 transitions. Stem has 43 letters. Loop has 7 letters. [2025-04-26 18:32:24,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:24,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 149 transitions. Stem has 50 letters. Loop has 7 letters. [2025-04-26 18:32:24,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:24,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 149 transitions. Stem has 43 letters. Loop has 14 letters. [2025-04-26 18:32:24,122 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:24,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 823 states and 1081 transitions. [2025-04-26 18:32:24,131 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 256 [2025-04-26 18:32:24,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 823 states to 357 states and 446 transitions. [2025-04-26 18:32:24,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2025-04-26 18:32:24,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2025-04-26 18:32:24,141 INFO L74 IsDeterministic]: Start isDeterministic. Operand 357 states and 446 transitions. [2025-04-26 18:32:24,144 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:24,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 446 transitions. [2025-04-26 18:32:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 446 transitions. [2025-04-26 18:32:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2025-04-26 18:32:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 1.25) internal successors, (in total 445), 355 states have internal predecessors, (445), 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 18:32:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 445 transitions. [2025-04-26 18:32:24,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 356 states and 445 transitions. [2025-04-26 18:32:24,174 INFO L438 stractBuchiCegarLoop]: Abstraction has 356 states and 445 transitions. [2025-04-26 18:32:24,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:32:24,174 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 445 transitions. [2025-04-26 18:32:24,175 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 256 [2025-04-26 18:32:24,175 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:24,175 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:24,176 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 18:32:24,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:32:24,177 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" [2025-04-26 18:32:24,177 INFO L754 eck$LassoCheckResult]: Loop: "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[391] L47-2-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[]" "[393] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[395] L47-4-->L52: Formula: (let ((.cse1 (* v_~front~0_35 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_36))) (and (<= 0 .cse0) (<= (+ .cse1 4 v_~queue~0.offset_36) (select |v_#length_39| v_~queue~0.base_36)) (= (+ v_~sum~0_30 (select (select |v_#memory_int_38| v_~queue~0.base_36) .cse0)) v_~sum~0_29) (not (= (ite (and (< v_~front~0_35 v_~n~0_12) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_53)) 1 0) 0)) (= (select |v_#valid_40| v_~queue~0.base_36) 1) (= v_~front~0_34 (+ v_~front~0_35 1))))) InVars {~sum~0=v_~sum~0_30, ~queue~0.offset=v_~queue~0.offset_36, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_38|, ~back~0=v_~back~0_53, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_36, ~n~0=v_~n~0_12, ~front~0=v_~front~0_35} OutVars{~queue~0.offset=v_~queue~0.offset_36, ~back~0=v_~back~0_53, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_36, ~sum~0=v_~sum~0_29, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_38|, #length=|v_#length_39|, ~n~0=v_~n~0_12, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~front~0]" [2025-04-26 18:32:24,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash -856709964, now seen corresponding path program 1 times [2025-04-26 18:32:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117355577] [2025-04-26 18:32:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 18:32:24,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 18:32:24,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 18:32:24,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 18:32:24,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:24,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 398008806, now seen corresponding path program 1 times [2025-04-26 18:32:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308128815] [2025-04-26 18:32:24,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:32:24,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:32:24,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:24,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:32:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:32:24,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:24,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 342062355, now seen corresponding path program 1 times [2025-04-26 18:32:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341664311] [2025-04-26 18:32:24,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-26 18:32:24,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-26 18:32:24,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:24,411 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 18:32:24,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:32:24,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341664311] [2025-04-26 18:32:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341664311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:32:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:32:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:32:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971749149] [2025-04-26 18:32:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:32:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:32:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:32:24,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:32:24,473 INFO L87 Difference]: Start difference. First operand 356 states and 445 transitions. cyclomatic complexity: 118 Second operand has 3 states, 2 states have (on average 30.5) internal successors, (in total 61), 3 states have internal predecessors, (61), 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 18:32:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:32:24,494 INFO L93 Difference]: Finished difference Result 350 states and 407 transitions. [2025-04-26 18:32:24,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 407 transitions. [2025-04-26 18:32:24,496 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 216 [2025-04-26 18:32:24,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 337 states and 394 transitions. [2025-04-26 18:32:24,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2025-04-26 18:32:24,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 330 [2025-04-26 18:32:24,502 INFO L74 IsDeterministic]: Start isDeterministic. Operand 337 states and 394 transitions. [2025-04-26 18:32:24,503 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:24,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 394 transitions. [2025-04-26 18:32:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 394 transitions. [2025-04-26 18:32:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 314. [2025-04-26 18:32:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 314 states have (on average 1.1751592356687899) internal successors, (in total 369), 313 states have internal predecessors, (369), 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 18:32:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 369 transitions. [2025-04-26 18:32:24,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 369 transitions. [2025-04-26 18:32:24,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:32:24,516 INFO L438 stractBuchiCegarLoop]: Abstraction has 314 states and 369 transitions. [2025-04-26 18:32:24,516 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:32:24,516 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 369 transitions. [2025-04-26 18:32:24,517 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 216 [2025-04-26 18:32:24,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:24,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:24,519 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:24,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:24,521 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[392] L47-2-->L47-5: Formula: (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_7| 256) 0) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[]" "[394] L47-5-->L47-7: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[388] L47-7-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base]" "[390] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:24,521 INFO L754 eck$LassoCheckResult]: Loop: "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" "[417] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_64))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_44))) (and (= (+ v_~back~0_64 1) v_~back~0_63) (<= (+ .cse0 4 v_~queue~0.offset_44) (select |v_#length_47| v_~queue~0.base_44)) (<= 0 .cse1) (= (select |v_#valid_48| v_~queue~0.base_44) 1) (not (= (ite (= (select (select |v_#memory_int_46| v_~queue~0.base_44) .cse1) 1) 1 0) 0))))) InVars {~back~0=v_~back~0_64, #memory_int=|v_#memory_int_46|, ~queue~0.offset=v_~queue~0.offset_44, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, #valid=|v_#valid_48|} OutVars{~queue~0.offset=v_~queue~0.offset_44, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_48|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~back~0=v_~back~0_63, #memory_int=|v_#memory_int_46|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post6#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:24,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1782821055, now seen corresponding path program 1 times [2025-04-26 18:32:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076766550] [2025-04-26 18:32:24,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:32:24,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:32:24,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:24,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:32:24,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:32:24,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:24,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash 702884152, now seen corresponding path program 1 times [2025-04-26 18:32:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820995035] [2025-04-26 18:32:24,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:24,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:24,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:24,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:24,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:24,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:24,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash -507830982, now seen corresponding path program 1 times [2025-04-26 18:32:24,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:24,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203683403] [2025-04-26 18:32:24,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 18:32:24,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 18:32:24,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:24,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:24,969 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 18:32:24,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:32:24,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203683403] [2025-04-26 18:32:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203683403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:32:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:32:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-26 18:32:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821305360] [2025-04-26 18:32:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:32:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:32:25,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 18:32:25,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-26 18:32:25,057 INFO L87 Difference]: Start difference. First operand 314 states and 369 transitions. cyclomatic complexity: 78 Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (in total 83), 12 states have internal predecessors, (83), 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 18:32:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:32:25,276 INFO L93 Difference]: Finished difference Result 380 states and 434 transitions. [2025-04-26 18:32:25,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 380 states and 434 transitions. [2025-04-26 18:32:25,278 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 216 [2025-04-26 18:32:25,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 380 states to 319 states and 373 transitions. [2025-04-26 18:32:25,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2025-04-26 18:32:25,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2025-04-26 18:32:25,280 INFO L74 IsDeterministic]: Start isDeterministic. Operand 319 states and 373 transitions. [2025-04-26 18:32:25,280 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:25,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 319 states and 373 transitions. [2025-04-26 18:32:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 373 transitions. [2025-04-26 18:32:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 314. [2025-04-26 18:32:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 314 states have (on average 1.1719745222929936) internal successors, (in total 368), 313 states have internal predecessors, (368), 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 18:32:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 368 transitions. [2025-04-26 18:32:25,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 368 transitions. [2025-04-26 18:32:25,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-26 18:32:25,286 INFO L438 stractBuchiCegarLoop]: Abstraction has 314 states and 368 transitions. [2025-04-26 18:32:25,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:32:25,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 368 transitions. [2025-04-26 18:32:25,287 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 216 [2025-04-26 18:32:25,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:25,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:25,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:25,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:25,289 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[392] L47-2-->L47-5: Formula: (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_7| 256) 0) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[]" "[394] L47-5-->L47-7: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[388] L47-7-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base]" "[390] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:25,289 INFO L754 eck$LassoCheckResult]: Loop: "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[416] L62-->L68: Formula: (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_5| 256) 0) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} AuxVars[] AssignedVars[]" "[418] L68-->L71: Formula: (let ((.cse1 (* 4 v_~back~0_58))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_40))) (and (<= 0 .cse0) (= v_~back~0_57 (+ v_~back~0_58 1)) (not (= (ite (= (+ (select (select |v_#memory_int_42| v_~queue~0.base_40) .cse0) 1) 0) 1 0) 0)) (= (select |v_#valid_44| v_~queue~0.base_40) 1) (<= (+ .cse1 4 v_~queue~0.offset_40) (select |v_#length_43| v_~queue~0.base_40))))) InVars {~back~0=v_~back~0_58, #memory_int=|v_#memory_int_42|, ~queue~0.offset=v_~queue~0.offset_40, #length=|v_#length_43|, ~queue~0.base=v_~queue~0.base_40, #valid=|v_#valid_44|} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #valid=|v_#valid_44|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, ~back~0=v_~back~0_57, #memory_int=|v_#memory_int_42|, #length=|v_#length_43|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~queue~0.base=v_~queue~0.base_40, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:25,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1482467739, now seen corresponding path program 1 times [2025-04-26 18:32:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168754236] [2025-04-26 18:32:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-26 18:32:25,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-26 18:32:25,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-26 18:32:25,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-26 18:32:25,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 702885144, now seen corresponding path program 1 times [2025-04-26 18:32:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492210339] [2025-04-26 18:32:25,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:25,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:25,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:25,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:25,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -8365772, now seen corresponding path program 1 times [2025-04-26 18:32:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675343910] [2025-04-26 18:32:25,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-26 18:32:25,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-26 18:32:25,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:32:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:32:25,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675343910] [2025-04-26 18:32:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675343910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:32:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:32:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:32:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856405281] [2025-04-26 18:32:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:32:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:32:25,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:32:25,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:32:25,471 INFO L87 Difference]: Start difference. First operand 314 states and 368 transitions. cyclomatic complexity: 77 Second operand has 3 states, 3 states have (on average 30.0) internal successors, (in total 90), 3 states have internal predecessors, (90), 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 18:32:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:32:25,491 INFO L93 Difference]: Finished difference Result 346 states and 404 transitions. [2025-04-26 18:32:25,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 404 transitions. [2025-04-26 18:32:25,493 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 221 [2025-04-26 18:32:25,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 346 states and 404 transitions. [2025-04-26 18:32:25,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2025-04-26 18:32:25,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2025-04-26 18:32:25,494 INFO L74 IsDeterministic]: Start isDeterministic. Operand 346 states and 404 transitions. [2025-04-26 18:32:25,495 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:25,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 346 states and 404 transitions. [2025-04-26 18:32:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states and 404 transitions. [2025-04-26 18:32:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 333. [2025-04-26 18:32:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.162162162162162) internal successors, (in total 387), 332 states have internal predecessors, (387), 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 18:32:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 387 transitions. [2025-04-26 18:32:25,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 387 transitions. [2025-04-26 18:32:25,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:32:25,502 INFO L438 stractBuchiCegarLoop]: Abstraction has 333 states and 387 transitions. [2025-04-26 18:32:25,503 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:32:25,503 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 387 transitions. [2025-04-26 18:32:25,504 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 216 [2025-04-26 18:32:25,504 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:25,504 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:25,506 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, 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 18:32:25,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:25,506 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[391] L47-2-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[]" "[393] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 18:32:25,507 INFO L754 eck$LassoCheckResult]: Loop: "[417] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_64))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_44))) (and (= (+ v_~back~0_64 1) v_~back~0_63) (<= (+ .cse0 4 v_~queue~0.offset_44) (select |v_#length_47| v_~queue~0.base_44)) (<= 0 .cse1) (= (select |v_#valid_48| v_~queue~0.base_44) 1) (not (= (ite (= (select (select |v_#memory_int_46| v_~queue~0.base_44) .cse1) 1) 1 0) 0))))) InVars {~back~0=v_~back~0_64, #memory_int=|v_#memory_int_46|, ~queue~0.offset=v_~queue~0.offset_44, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, #valid=|v_#valid_48|} OutVars{~queue~0.offset=v_~queue~0.offset_44, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_48|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~back~0=v_~back~0_63, #memory_int=|v_#memory_int_46|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post6#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 18:32:25,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1889920532, now seen corresponding path program 1 times [2025-04-26 18:32:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129417327] [2025-04-26 18:32:25,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-26 18:32:25,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-26 18:32:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-26 18:32:25,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-26 18:32:25,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1560717684, now seen corresponding path program 2 times [2025-04-26 18:32:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404598465] [2025-04-26 18:32:25,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:32:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:25,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:25,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:32:25,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:32:25,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:32:25,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash -417564095, now seen corresponding path program 1 times [2025-04-26 18:32:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899373669] [2025-04-26 18:32:25,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-26 18:32:25,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-26 18:32:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:32:25,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:32:25,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899373669] [2025-04-26 18:32:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899373669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:32:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:32:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:32:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952252818] [2025-04-26 18:32:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:32:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:32:25,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:32:25,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:32:25,809 INFO L87 Difference]: Start difference. First operand 333 states and 387 transitions. cyclomatic complexity: 77 Second operand has 4 states, 3 states have (on average 33.0) internal successors, (in total 99), 4 states have internal predecessors, (99), 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 18:32:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:32:25,837 INFO L93 Difference]: Finished difference Result 525 states and 599 transitions. [2025-04-26 18:32:25,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 599 transitions. [2025-04-26 18:32:25,841 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 404 [2025-04-26 18:32:25,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 525 states and 599 transitions. [2025-04-26 18:32:25,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-04-26 18:32:25,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-04-26 18:32:25,846 INFO L74 IsDeterministic]: Start isDeterministic. Operand 525 states and 599 transitions. [2025-04-26 18:32:25,846 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:25,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 525 states and 599 transitions. [2025-04-26 18:32:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 599 transitions. [2025-04-26 18:32:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 446. [2025-04-26 18:32:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 446 states have (on average 1.1278026905829597) internal successors, (in total 503), 445 states have internal predecessors, (503), 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 18:32:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 503 transitions. [2025-04-26 18:32:25,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 446 states and 503 transitions. [2025-04-26 18:32:25,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:32:25,858 INFO L438 stractBuchiCegarLoop]: Abstraction has 446 states and 503 transitions. [2025-04-26 18:32:25,858 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:32:25,858 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 503 transitions. [2025-04-26 18:32:25,860 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 344 [2025-04-26 18:32:25,860 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:25,860 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:25,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:25,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-26 18:32:25,865 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[392] L47-2-->L47-5: Formula: (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_7| 256) 0) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[]" "[394] L47-5-->L47-7: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[388] L47-7-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base]" "[390] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:25,865 INFO L754 eck$LassoCheckResult]: Loop: "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" "[417] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_64))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_44))) (and (= (+ v_~back~0_64 1) v_~back~0_63) (<= (+ .cse0 4 v_~queue~0.offset_44) (select |v_#length_47| v_~queue~0.base_44)) (<= 0 .cse1) (= (select |v_#valid_48| v_~queue~0.base_44) 1) (not (= (ite (= (select (select |v_#memory_int_46| v_~queue~0.base_44) .cse1) 1) 1 0) 0))))) InVars {~back~0=v_~back~0_64, #memory_int=|v_#memory_int_46|, ~queue~0.offset=v_~queue~0.offset_44, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, #valid=|v_#valid_48|} OutVars{~queue~0.offset=v_~queue~0.offset_44, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_48|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~back~0=v_~back~0_63, #memory_int=|v_#memory_int_46|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post6#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[416] L62-->L68: Formula: (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_5| 256) 0) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} AuxVars[] AssignedVars[]" "[418] L68-->L71: Formula: (let ((.cse1 (* 4 v_~back~0_58))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_40))) (and (<= 0 .cse0) (= v_~back~0_57 (+ v_~back~0_58 1)) (not (= (ite (= (+ (select (select |v_#memory_int_42| v_~queue~0.base_40) .cse0) 1) 0) 1 0) 0)) (= (select |v_#valid_44| v_~queue~0.base_40) 1) (<= (+ .cse1 4 v_~queue~0.offset_40) (select |v_#length_43| v_~queue~0.base_40))))) InVars {~back~0=v_~back~0_58, #memory_int=|v_#memory_int_42|, ~queue~0.offset=v_~queue~0.offset_40, #length=|v_#length_43|, ~queue~0.base=v_~queue~0.base_40, #valid=|v_#valid_44|} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #valid=|v_#valid_44|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, ~back~0=v_~back~0_57, #memory_int=|v_#memory_int_42|, #length=|v_#length_43|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~queue~0.base=v_~queue~0.base_40, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:25,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1482467739, now seen corresponding path program 2 times [2025-04-26 18:32:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696538375] [2025-04-26 18:32:25,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:32:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-26 18:32:25,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-04-26 18:32:25,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:32:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-26 18:32:25,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-26 18:32:25,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 135329089, now seen corresponding path program 1 times [2025-04-26 18:32:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388800562] [2025-04-26 18:32:25,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:32:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:32:25,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:25,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:32:25,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:32:25,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:25,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:25,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 960452261, now seen corresponding path program 1 times [2025-04-26 18:32:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:25,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502267925] [2025-04-26 18:32:25,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:25,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-26 18:32:25,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 18:32:25,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:25,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:32:26,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:32:26,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502267925] [2025-04-26 18:32:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502267925] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:32:26,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576223365] [2025-04-26 18:32:26,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:32:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:26,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:32:26,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-26 18:32:26,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-26 18:32:26,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-26 18:32:26,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:26,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:26,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 18:32:26,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:32:26,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:32:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:32:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576223365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:32:27,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:32:27,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 39 [2025-04-26 18:32:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891820133] [2025-04-26 18:32:27,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:32:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:32:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-26 18:32:27,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2025-04-26 18:32:27,600 INFO L87 Difference]: Start difference. First operand 446 states and 503 transitions. cyclomatic complexity: 80 Second operand has 39 states, 39 states have (on average 6.512820512820513) internal successors, (in total 254), 39 states have internal predecessors, (254), 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 18:32:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:32:28,558 INFO L93 Difference]: Finished difference Result 629 states and 706 transitions. [2025-04-26 18:32:28,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 629 states and 706 transitions. [2025-04-26 18:32:28,561 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 409 [2025-04-26 18:32:28,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 629 states to 567 states and 644 transitions. [2025-04-26 18:32:28,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2025-04-26 18:32:28,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2025-04-26 18:32:28,566 INFO L74 IsDeterministic]: Start isDeterministic. Operand 567 states and 644 transitions. [2025-04-26 18:32:28,566 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:28,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 567 states and 644 transitions. [2025-04-26 18:32:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states and 644 transitions. [2025-04-26 18:32:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 501. [2025-04-26 18:32:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 501 states have (on average 1.1197604790419162) internal successors, (in total 561), 500 states have internal predecessors, (561), 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 18:32:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 561 transitions. [2025-04-26 18:32:28,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 501 states and 561 transitions. [2025-04-26 18:32:28,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-26 18:32:28,579 INFO L438 stractBuchiCegarLoop]: Abstraction has 501 states and 561 transitions. [2025-04-26 18:32:28,579 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:32:28,579 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 561 transitions. [2025-04-26 18:32:28,580 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 349 [2025-04-26 18:32:28,580 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:28,580 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:28,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:32:28,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-26 18:32:28,584 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[392] L47-2-->L47-5: Formula: (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_7| 256) 0) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_7|} AuxVars[] AssignedVars[]" "[394] L47-5-->L47-7: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[388] L47-7-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base]" "[390] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:28,585 INFO L754 eck$LassoCheckResult]: Loop: "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" "[417] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_64))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_44))) (and (= (+ v_~back~0_64 1) v_~back~0_63) (<= (+ .cse0 4 v_~queue~0.offset_44) (select |v_#length_47| v_~queue~0.base_44)) (<= 0 .cse1) (= (select |v_#valid_48| v_~queue~0.base_44) 1) (not (= (ite (= (select (select |v_#memory_int_46| v_~queue~0.base_44) .cse1) 1) 1 0) 0))))) InVars {~back~0=v_~back~0_64, #memory_int=|v_#memory_int_46|, ~queue~0.offset=v_~queue~0.offset_44, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, #valid=|v_#valid_48|} OutVars{~queue~0.offset=v_~queue~0.offset_44, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_48|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~back~0=v_~back~0_63, #memory_int=|v_#memory_int_46|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post6#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[416] L62-->L68: Formula: (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_5| 256) 0) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_5|} AuxVars[] AssignedVars[]" "[418] L68-->L71: Formula: (let ((.cse1 (* 4 v_~back~0_58))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_40))) (and (<= 0 .cse0) (= v_~back~0_57 (+ v_~back~0_58 1)) (not (= (ite (= (+ (select (select |v_#memory_int_42| v_~queue~0.base_40) .cse0) 1) 0) 1 0) 0)) (= (select |v_#valid_44| v_~queue~0.base_40) 1) (<= (+ .cse1 4 v_~queue~0.offset_40) (select |v_#length_43| v_~queue~0.base_40))))) InVars {~back~0=v_~back~0_58, #memory_int=|v_#memory_int_42|, ~queue~0.offset=v_~queue~0.offset_40, #length=|v_#length_43|, ~queue~0.base=v_~queue~0.base_40, #valid=|v_#valid_44|} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #valid=|v_#valid_44|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, ~back~0=v_~back~0_57, #memory_int=|v_#memory_int_42|, #length=|v_#length_43|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~queue~0.base=v_~queue~0.base_40, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1]" "[419] L71-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_7|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" [2025-04-26 18:32:28,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -279762433, now seen corresponding path program 3 times [2025-04-26 18:32:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:28,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832345525] [2025-04-26 18:32:28,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:32:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:28,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 3 equivalence classes. [2025-04-26 18:32:28,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:32:28,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:32:28,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:28,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 18:32:28,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:32:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:28,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash 135329089, now seen corresponding path program 2 times [2025-04-26 18:32:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:28,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991163743] [2025-04-26 18:32:28,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:32:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:28,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 18:32:28,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:32:28,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:32:28,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:28,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:32:28,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:32:28,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:28,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:28,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2143387071, now seen corresponding path program 2 times [2025-04-26 18:32:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:28,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66004137] [2025-04-26 18:32:28,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:32:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:28,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-26 18:32:28,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-26 18:32:28,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:32:28,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:28,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-26 18:32:28,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-26 18:32:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:28,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:29,778 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:32:29,778 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:32:29,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:32:29,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:32:29,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:32:29,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:29,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:32:29,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:32:29,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_petrified1_Iteration7_Lasso [2025-04-26 18:32:29,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:32:29,778 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:32:29,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:29,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:30,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:30,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:30,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:30,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:32:30,412 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:32:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,414 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 18:32:30,415 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 18:32:30,415 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 18:32:30,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,427 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,432 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 18:32:30,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,434 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 18:32:30,435 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 18:32:30,436 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 18:32:30,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,455 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 18:32:30,457 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 18:32:30,457 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 18:32:30,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,468 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,474 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 18:32:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,476 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 18:32:30,477 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 18:32:30,478 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 18:32:30,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,494 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 18:32:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,496 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 18:32:30,497 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 18:32:30,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 18:32:30,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:32:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,516 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 18:32:30,516 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 18:32:30,517 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 18:32:30,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,528 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,533 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 18:32:30,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,535 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 18:32:30,536 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 18:32:30,536 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 18:32:30,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,549 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:32:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,557 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 18:32:30,557 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 18:32:30,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 18:32:30,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,569 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,575 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 18:32:30,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,577 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 18:32:30,578 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 18:32:30,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 18:32:30,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,598 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 18:32:30,599 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 18:32:30,600 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 18:32:30,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,617 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 18:32:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,619 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 18:32:30,620 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 18:32:30,621 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 18:32:30,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,632 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,637 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 18:32:30,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,639 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 18:32:30,639 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 18:32:30,641 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 18:32:30,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,651 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,658 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 18:32:30,659 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 18:32:30,660 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 18:32:30,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,679 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 18:32:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,681 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 18:32:30,682 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 18:32:30,683 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 18:32:30,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,703 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 18:32:30,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,705 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 18:32:30,705 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 18:32:30,706 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 18:32:30,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,722 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 18:32:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,724 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 18:32:30,725 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 18:32:30,726 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 18:32:30,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,739 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:32:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,746 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 18:32:30,747 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 18:32:30,748 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 18:32:30,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,759 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,764 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 18:32:30,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,766 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 18:32:30,766 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 18:32:30,767 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 18:32:30,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,778 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:32:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,785 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 18:32:30,786 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 18:32:30,787 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 18:32:30,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,803 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,808 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 18:32:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,810 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 18:32:30,811 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 18:32:30,811 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 18:32:30,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,824 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,830 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 18:32:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,831 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 18:32:30,832 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 18:32:30,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 18:32:30,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,846 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,853 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 18:32:30,854 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 18:32:30,854 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 18:32:30,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,865 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,873 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 18:32:30,873 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 18:32:30,874 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 18:32:30,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:30,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:30,886 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,892 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 18:32:30,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,894 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 18:32:30,896 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 18:32:30,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 18:32:30,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,916 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 18:32:30,917 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 18:32:30,918 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 18:32:30,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:32:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,936 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 18:32:30,937 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 18:32:30,939 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 18:32:30,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:32:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,958 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 18:32:30,958 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 18:32:30,959 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 18:32:30,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,970 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,975 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 18:32:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,977 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 18:32:30,977 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 18:32:30,980 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 18:32:30,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:30,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:30,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:30,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:30,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:30,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:30,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:30,991 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:30,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:30,997 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 18:32:30,998 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 18:32:30,999 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 18:32:31,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,010 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,015 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 18:32:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,016 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 18:32:31,017 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 18:32:31,018 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 18:32:31,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,029 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,035 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 18:32:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,037 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 18:32:31,038 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 18:32:31,039 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 18:32:31,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,050 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:32:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,058 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 18:32:31,060 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 18:32:31,061 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 18:32:31,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,077 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,085 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 18:32:31,086 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 18:32:31,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 18:32:31,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,107 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 18:32:31,109 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 18:32:31,110 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 18:32:31,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,129 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 18:32:31,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,131 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 18:32:31,132 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 18:32:31,134 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 18:32:31,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,155 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 18:32:31,156 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 18:32:31,156 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 18:32:31,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,172 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 18:32:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,174 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 18:32:31,175 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 18:32:31,177 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 18:32:31,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,196 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 18:32:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,198 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 18:32:31,208 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 18:32:31,209 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 18:32:31,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,227 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 18:32:31,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,229 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 18:32:31,230 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 18:32:31,230 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 18:32:31,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,241 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,247 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 18:32:31,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,249 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 18:32:31,249 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 18:32:31,250 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 18:32:31,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,261 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,266 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 18:32:31,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,268 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 18:32:31,269 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 18:32:31,270 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 18:32:31,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,283 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,288 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 18:32:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,290 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 18:32:31,290 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 18:32:31,291 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 18:32:31,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,310 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 18:32:31,310 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 18:32:31,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:32:31,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,323 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 18:32:31,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,330 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 18:32:31,331 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 18:32:31,332 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 18:32:31,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,343 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,348 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 18:32:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,350 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 18:32:31,351 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 18:32:31,352 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 18:32:31,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,369 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,374 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 18:32:31,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,376 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 18:32:31,376 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 18:32:31,377 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 18:32:31,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,398 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 18:32:31,398 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 18:32:31,399 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 18:32:31,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,417 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 18:32:31,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,419 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 18:32:31,419 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 18:32:31,421 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 18:32:31,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,432 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,438 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 18:32:31,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,440 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 18:32:31,441 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 18:32:31,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:32:31,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,453 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,459 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 18:32:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,461 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 18:32:31,462 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 18:32:31,464 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 18:32:31,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,482 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 18:32:31,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,484 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 18:32:31,484 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 18:32:31,485 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 18:32:31,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,499 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,506 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 18:32:31,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,508 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 18:32:31,510 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 18:32:31,511 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 18:32:31,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,530 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 18:32:31,530 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 18:32:31,531 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 18:32:31,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,543 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,549 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 18:32:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,550 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 18:32:31,551 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 18:32:31,552 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 18:32:31,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,564 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,570 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 18:32:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,571 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 18:32:31,572 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 18:32:31,573 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 18:32:31,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,592 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 18:32:31,592 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 18:32:31,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 18:32:31,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,608 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,614 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 18:32:31,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,616 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 18:32:31,616 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 18:32:31,617 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 18:32:31,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,630 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,636 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 18:32:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,637 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 18:32:31,638 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 18:32:31,639 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 18:32:31,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,649 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:32:31,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:32:31,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,655 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,660 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 18:32:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,662 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 18:32:31,663 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 18:32:31,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:32:31,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,680 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 18:32:31,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,682 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 18:32:31,683 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 18:32:31,684 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 18:32:31,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,695 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,701 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 18:32:31,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,704 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 18:32:31,705 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 18:32:31,707 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 18:32:31,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,720 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:31,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,726 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 18:32:31,727 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 18:32:31,728 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 18:32:31,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:31,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:31,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:31,739 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,744 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 18:32:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,746 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 18:32:31,747 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 18:32:31,748 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 18:32:31,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,767 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 18:32:31,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,769 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 18:32:31,770 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 18:32:31,770 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 18:32:31,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,783 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,788 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 18:32:31,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,789 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 18:32:31,790 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 18:32:31,791 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 18:32:31,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:31,809 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 18:32:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,811 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 18:32:31,811 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 18:32:31,812 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 18:32:31,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:31,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:31,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:31,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:31,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:31,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:31,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:32:31,844 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:32:31,844 INFO L437 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 18:32:31,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:31,845 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 18:32:31,846 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 18:32:31,847 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:32:31,862 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 18:32:31,862 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:32:31,862 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:32:31,862 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1) = -1*~back~0 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1 Supporting invariants [1*~queue~0.offset >= 0] [2025-04-26 18:32:31,867 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 18:32:31,892 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-04-26 18:32:31,897 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 18:32:31,898 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 18:32:31,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:31,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 18:32:31,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:32:31,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:31,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:31,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 18:32:31,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:32:32,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:32:32,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:32,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:32:32,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:32:32,421 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2025-04-26 18:32:32,421 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 501 states and 561 transitions. cyclomatic complexity: 84 Second operand has 10 states, 10 states have (on average 10.3) internal successors, (in total 103), 10 states have internal predecessors, (103), 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 18:32:32,559 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 501 states and 561 transitions. cyclomatic complexity: 84. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (in total 103), 10 states have internal predecessors, (103), 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 896 states and 1028 transitions. Complement of second has 12 states. [2025-04-26 18:32:32,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 9 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:32:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 10.3) internal successors, (in total 103), 10 states have internal predecessors, (103), 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 18:32:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2025-04-26 18:32:32,560 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 114 transitions. Stem has 84 letters. Loop has 26 letters. [2025-04-26 18:32:32,560 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:32,560 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 114 transitions. Stem has 110 letters. Loop has 26 letters. [2025-04-26 18:32:32,561 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:32,561 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 114 transitions. Stem has 84 letters. Loop has 52 letters. [2025-04-26 18:32:32,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:32,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1028 transitions. [2025-04-26 18:32:32,568 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 95 [2025-04-26 18:32:32,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 392 states and 447 transitions. [2025-04-26 18:32:32,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2025-04-26 18:32:32,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2025-04-26 18:32:32,570 INFO L74 IsDeterministic]: Start isDeterministic. Operand 392 states and 447 transitions. [2025-04-26 18:32:32,570 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:32:32,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 392 states and 447 transitions. [2025-04-26 18:32:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states and 447 transitions. [2025-04-26 18:32:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 357. [2025-04-26 18:32:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 357 states have (on average 1.145658263305322) internal successors, (in total 409), 356 states have internal predecessors, (409), 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 18:32:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 409 transitions. [2025-04-26 18:32:32,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 357 states and 409 transitions. [2025-04-26 18:32:32,578 INFO L438 stractBuchiCegarLoop]: Abstraction has 357 states and 409 transitions. [2025-04-26 18:32:32,578 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:32:32,578 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 409 transitions. [2025-04-26 18:32:32,579 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 90 [2025-04-26 18:32:32,579 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:32:32,579 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:32:32,584 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, 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 18:32:32,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:32:32,585 INFO L752 eck$LassoCheckResult]: Stem: "[283] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[290] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[]" "[343] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[363] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_6| 1) 0) 48) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[]" "[296] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_7| 1) 1) 0) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[331] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[315] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[303] L42-->L42-1: Formula: (= v_~front~0_7 0) InVars {} OutVars{~front~0=v_~front~0_7} AuxVars[] AssignedVars[~front~0]" "[364] L42-1-->L42-2: Formula: (= v_~back~0_10 0) InVars {} OutVars{~back~0=v_~back~0_10} AuxVars[] AssignedVars[~back~0]" "[313] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0]" "[277] L42-3-->L-1-1: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[375] 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]" "[376] L-1-2-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_5|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|, 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~pre12#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[263] L80-->L80-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]" "[361] L80-1-->L80-2: 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]" "[273] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[333] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[~n~0]" "[379] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[278] L83-->L83-1: 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]" "[319] L83-1-->L83-2: Formula: (= v_~front~0_5 |v_ULTIMATE.start_main_#t~nondet10#1_2|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0]" "[357] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[365] L84-->L85: Formula: (= v_~back~0_9 v_~front~0_6) InVars {~front~0=v_~front~0_6} OutVars{~back~0=v_~back~0_9, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~back~0]" "[289] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_4) InVars {~n~0=v_~n~0_4} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[301] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[260] L85-2-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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_#t~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[348] L99-->L100: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[302] L100-->L100-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 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_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[324] L100-1-->L37: 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]" "[304] L37-->L38: 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]" "[317] L38-->L37-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[]" "[305] L37-1-->L100-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]" "[345] L100-2-->L101: 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]" "[369] L101-->L101-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[274] L101-1-->L37-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]" "[270] L37-2-->L38-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]" "[288] L38-3-->L37-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[]" "[284] L37-3-->L101-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]" "[330] L101-2-->L103: 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]" "[366] L103-->L103-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length]" "[292] L103-1-->L103-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_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_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base]" "[342] L103-2-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset]" "[272] L104-->L104-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[335] L104-5-->L105: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[271] L105-->L105-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[306] L105-1-->L105-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|)) |v_#memory_int_4|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int]" "[291] L105-2-->L104-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1]" "[384] L104-2-->L104-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[308] L104-3-->L104-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[269] L104-4-->L104-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post18#1]" "[334] L104-5-->L104-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[353] L104-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1]" "[374] L107-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[360] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[351] L85-3-->L85-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_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~nondet17#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_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1]" "[297] L85-4-->L85-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[372] L85-5-->L85-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base]" "[262] L85-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base]" "[339] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[362] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[267] L88-2-->L88-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_1| |v_ULTIMATE.start_main_#t~pre12#1_2|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[425] L88-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4| 0) (= 0 |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[385] $Ultimate##0-->L52: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|) (= |v_thread1Thread1of1ForFork1_~_argptr#1.base_1| |v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|)) InVars {thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|} OutVars{thread1Thread1of1ForFork1_~_argptr#1.offset=|v_thread1Thread1of1ForFork1_~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread1Thread1of1ForFork1_#in~_argptr#1.base=|v_thread1Thread1of1ForFork1_#in~_argptr#1.base_1|, thread1Thread1of1ForFork1_~_argptr#1.base=|v_thread1Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[391] L47-2-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[]" "[393] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[383] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[349] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[322] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[299] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[329] L89-2-->L89-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_1| |v_ULTIMATE.start_main_#t~pre14#1_2|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[422] L89-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_12|, thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_4|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_4|, thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_14|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_4|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~b~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~nondet4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1]" "[396] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork0_~_argptr#1.base_1| |v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork0_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork0_~_argptr#1.base=|v_thread2Thread1of1ForFork0_~_argptr#1.base_1|, thread2Thread1of1ForFork0_#in~_argptr#1.base=|v_thread2Thread1of1ForFork0_#in~_argptr#1.base_1|, thread2Thread1of1ForFork0_~_argptr#1.offset=|v_thread2Thread1of1ForFork0_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr#1.base, thread2Thread1of1ForFork0_~_argptr#1.offset]" "[397] L59-->L60-7: Formula: (= |v_thread2Thread1of1ForFork0_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~b~0#1]" "[399] L60-7-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[401] L60-1-->L60-2: Formula: (or (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 0) (= |v_thread2Thread1of1ForFork0_#t~nondet4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[]" "[403] L60-2-->L60-3: Formula: (not (= 0 (mod |v_thread2Thread1of1ForFork0_#t~nondet4#1_5| 256))) InVars {thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_5|} AuxVars[] AssignedVars[]" "[405] L60-3-->L60-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet4#1=|v_thread2Thread1of1ForFork0_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet4#1]" "[407] L60-4-->L61: Formula: (= (ite (and (< v_~back~0_2 v_~n~0_2) (<= 0 v_~back~0_2)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_2, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[408] L61-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[409] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[411] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[413] L37-1-->L61-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[414] L61-1-->L62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[415] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} OutVars{thread2Thread1of1ForFork0_~b~0#1=|v_thread2Thread1of1ForFork0_~b~0#1_3|} AuxVars[] AssignedVars[]" "[417] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_64))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_44))) (and (= (+ v_~back~0_64 1) v_~back~0_63) (<= (+ .cse0 4 v_~queue~0.offset_44) (select |v_#length_47| v_~queue~0.base_44)) (<= 0 .cse1) (= (select |v_#valid_48| v_~queue~0.base_44) 1) (not (= (ite (= (select (select |v_#memory_int_46| v_~queue~0.base_44) .cse1) 1) 1 0) 0))))) InVars {~back~0=v_~back~0_64, #memory_int=|v_#memory_int_46|, ~queue~0.offset=v_~queue~0.offset_44, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, #valid=|v_#valid_48|} OutVars{~queue~0.offset=v_~queue~0.offset_44, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #valid=|v_#valid_48|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~back~0=v_~back~0_63, #memory_int=|v_#memory_int_46|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, #length=|v_#length_47|, ~queue~0.base=v_~queue~0.base_44, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~back~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post6#1]" [2025-04-26 18:32:32,585 INFO L754 eck$LassoCheckResult]: Loop: "[395] L47-4-->L52: Formula: (let ((.cse1 (* v_~front~0_35 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_36))) (and (<= 0 .cse0) (<= (+ .cse1 4 v_~queue~0.offset_36) (select |v_#length_39| v_~queue~0.base_36)) (= (+ v_~sum~0_30 (select (select |v_#memory_int_38| v_~queue~0.base_36) .cse0)) v_~sum~0_29) (not (= (ite (and (< v_~front~0_35 v_~n~0_12) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_53)) 1 0) 0)) (= (select |v_#valid_40| v_~queue~0.base_36) 1) (= v_~front~0_34 (+ v_~front~0_35 1))))) InVars {~sum~0=v_~sum~0_30, ~queue~0.offset=v_~queue~0.offset_36, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_38|, ~back~0=v_~back~0_53, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_36, ~n~0=v_~n~0_12, ~front~0=v_~front~0_35} OutVars{~queue~0.offset=v_~queue~0.offset_36, ~back~0=v_~back~0_53, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_36, ~sum~0=v_~sum~0_29, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_38|, #length=|v_#length_39|, ~n~0=v_~n~0_12, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~front~0]" "[387] L52-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" "[389] L47-1-->L47-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 1) (= |v_thread1Thread1of1ForFork1_#t~nondet1#1_3| 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_3|} AuxVars[] AssignedVars[]" "[391] L47-2-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_5|} AuxVars[] AssignedVars[]" "[393] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1#1]" [2025-04-26 18:32:32,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1542005235, now seen corresponding path program 1 times [2025-04-26 18:32:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:32,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116131126] [2025-04-26 18:32:32,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:32,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 18:32:32,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 18:32:32,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:32,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 18:32:32,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 18:32:32,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:32,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 405335406, now seen corresponding path program 2 times [2025-04-26 18:32:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:32,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687217198] [2025-04-26 18:32:32,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:32:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:32,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:32:32,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:32:32,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:32:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:32,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:32:32,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:32:32,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:32,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2049373922, now seen corresponding path program 1 times [2025-04-26 18:32:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:32:32,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936932552] [2025-04-26 18:32:32,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:32:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:32:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-26 18:32:32,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-26 18:32:32,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:32:32,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-26 18:32:32,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-26 18:32:32,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:32,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:32:32,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:32:33,756 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:32:33,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:32:33,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:32:33,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:32:33,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:32:33,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:33,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:32:33,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:32:33,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_petrified1_Iteration8_Lasso [2025-04-26 18:32:33,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:32:33,756 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:32:33,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:33,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:32:34,382 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:32:34,383 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:32:34,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,384 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 18:32:34,386 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 18:32:34,387 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 18:32:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,405 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 18:32:34,406 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 18:32:34,407 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 18:32:34,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,422 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 18:32:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,424 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 18:32:34,425 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 18:32:34,426 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 18:32:34,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,448 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 18:32:34,449 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 18:32:34,450 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 18:32:34,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,467 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 18:32:34,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,469 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 18:32:34,470 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 18:32:34,471 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 18:32:34,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,489 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 18:32:34,490 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 18:32:34,490 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 18:32:34,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,501 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,507 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 18:32:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,509 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 18:32:34,509 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 18:32:34,510 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 18:32:34,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,527 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 18:32:34,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,529 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 18:32:34,530 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 18:32:34,530 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 18:32:34,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,543 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 18:32:34,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,549 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 18:32:34,550 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 18:32:34,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:32:34,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,567 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 18:32:34,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,569 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 18:32:34,569 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 18:32:34,570 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 18:32:34,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:32:34,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:32:34,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:32:34,581 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,586 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 18:32:34,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,588 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 18:32:34,588 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 18:32:34,589 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 18:32:34,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,609 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 18:32:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,611 INFO L229 MonitoredProcess]: Starting monitored process 95 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 18:32:34,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 18:32:34,612 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 18:32:34,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,625 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-04-26 18:32:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,632 INFO L229 MonitoredProcess]: Starting monitored process 96 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 18:32:34,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-04-26 18:32:34,633 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 18:32:34,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,646 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-04-26 18:32:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,653 INFO L229 MonitoredProcess]: Starting monitored process 97 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 18:32:34,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-04-26 18:32:34,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 18:32:34,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-04-26 18:32:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,675 INFO L229 MonitoredProcess]: Starting monitored process 98 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 18:32:34,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-04-26 18:32:34,677 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 18:32:34,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,689 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-04-26 18:32:34,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,696 INFO L229 MonitoredProcess]: Starting monitored process 99 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 18:32:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-04-26 18:32:34,698 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 18:32:34,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,712 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,718 INFO L229 MonitoredProcess]: Starting monitored process 100 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 18:32:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-04-26 18:32:34,720 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 18:32:34,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,733 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-04-26 18:32:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,740 INFO L229 MonitoredProcess]: Starting monitored process 101 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 18:32:34,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-04-26 18:32:34,741 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 18:32:34,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,751 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:32:34,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,752 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:32:34,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,756 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,763 INFO L229 MonitoredProcess]: Starting monitored process 102 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 18:32:34,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-04-26 18:32:34,765 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 18:32:34,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:32:34,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-04-26 18:32:34,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,784 INFO L229 MonitoredProcess]: Starting monitored process 103 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 18:32:34,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-04-26 18:32:34,785 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 18:32:34,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:32:34,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:32:34,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:32:34,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:32:34,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:32:34,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:32:34,806 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:32:34,838 INFO L436 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2025-04-26 18:32:34,838 INFO L437 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 18:32:34,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:32:34,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:32:34,840 INFO L229 MonitoredProcess]: Starting monitored process 104 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 18:32:34,852 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:32:34,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-04-26 18:32:34,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:34,871 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:32:34,871 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:32:34,871 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~front~0) = 1*~n~0 - 1*~front~0 Supporting invariants [] [2025-04-26 18:32:34,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-04-26 18:32:34,903 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-04-26 18:32:34,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:32:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 18:32:34,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 18:32:34,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:34,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:34,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:32:34,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:35,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:32:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:32:35,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:32:35,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:32:35,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:32:35,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:32:35,033 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 18:32:35,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:32:35,034 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 357 states and 409 transitions. cyclomatic complexity: 74 Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (in total 92), 3 states have internal predecessors, (92), 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 18:32:35,066 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 357 states and 409 transitions. cyclomatic complexity: 74. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (in total 92), 3 states have internal predecessors, (92), 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 597 states and 710 transitions. Complement of second has 4 states. [2025-04-26 18:32:35,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:32:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (in total 92), 3 states have internal predecessors, (92), 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 18:32:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-04-26 18:32:35,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 119 transitions. Stem has 87 letters. Loop has 5 letters. [2025-04-26 18:32:35,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:35,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 119 transitions. Stem has 92 letters. Loop has 5 letters. [2025-04-26 18:32:35,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:35,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 119 transitions. Stem has 87 letters. Loop has 10 letters. [2025-04-26 18:32:35,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:32:35,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 710 transitions. [2025-04-26 18:32:35,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:32:35,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:32:35,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:32:35,074 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:32:35,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:32:35,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:32:35,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:32:35,074 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:32:35,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:32:35,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:32:35 BoogieIcfgContainer [2025-04-26 18:32:35,089 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:32:35,090 INFO L158 Benchmark]: Toolchain (without parser) took 14003.54ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 107.0MB in the beginning and 286.0MB in the end (delta: -179.0MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. [2025-04-26 18:32:35,090 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:32:35,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.42ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 92.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:32:35,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.75ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 91.0MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:32:35,091 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 89.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:32:35,091 INFO L158 Benchmark]: RCFGBuilder took 413.15ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 65.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-26 18:32:35,091 INFO L158 Benchmark]: BuchiAutomizer took 13339.04ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 65.9MB in the beginning and 286.0MB in the end (delta: -220.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:32:35,094 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.76ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.42ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 92.7MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.75ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 91.0MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 89.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 413.15ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 65.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 13339.04ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 65.9MB in the beginning and 286.0MB in the end (delta: -220.1MB). There was no memory consumed. 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 13.2s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 10.2s. Construction of modules took 0.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 222 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s 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: 12/12 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 4119 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3367 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 953 IncrementalHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 752 mSDtfsCounter, 953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax114 hnf100 lsp69 ukn78 mio100 lsp44 div184 bol100 ite100 ukn100 eq146 hnf94 smp69 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 291, Number of transitions in reduction automaton: 550, Number of states in reduction automaton: 422, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 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 11 locations. One deterministic module has affine ranking function (((long long) -1 * front) + n) and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 39 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:32:35,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-26 18:32:35,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...