/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-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:28:55,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:28:55,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:28:55,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:28:55,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:28:55,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:28:55,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:28:55,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:28:55,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:28:55,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:28:55,339 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:28:55,339 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:28:55,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:28:55,340 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:28:55,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:28:55,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:28:55,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:28:55,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:28:55,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:28:55,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:28:55,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:28:55,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:28:55,343 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:28:55,343 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:28:55,343 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:28:55,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:28:55,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:28:55,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:28:55,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:28:55,559 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:28:55,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2025-04-26 18:28:56,862 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/28bdf0b65/c7be6fb47a5647a7a00661b858a41ba6/FLAG79c1154e4 [2025-04-26 18:28:57,059 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:28:57,060 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2025-04-26 18:28:57,067 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/28bdf0b65/c7be6fb47a5647a7a00661b858a41ba6/FLAG79c1154e4 [2025-04-26 18:28:57,913 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/28bdf0b65/c7be6fb47a5647a7a00661b858a41ba6 [2025-04-26 18:28:57,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:28:57,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:28:57,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:28:57,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:28:57,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:28:57,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:28:57" (1/1) ... [2025-04-26 18:28:57,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a5994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:57, skipping insertion in model container [2025-04-26 18:28:57,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:28:57" (1/1) ... [2025-04-26 18:28:57,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:28:58,092 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-counter-determinism.wvr.c[2218,2231] [2025-04-26 18:28:58,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:28:58,105 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:28:58,139 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-counter-determinism.wvr.c[2218,2231] [2025-04-26 18:28:58,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:28:58,151 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:28:58,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58 WrapperNode [2025-04-26 18:28:58,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:28:58,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:28:58,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:28:58,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:28:58,158 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:28:58" (1/1) ... [2025-04-26 18:28:58,166 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:28:58" (1/1) ... [2025-04-26 18:28:58,182 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2025-04-26 18:28:58,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:28:58,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:28:58,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:28:58,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:28:58,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:28:58,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:28:58,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:28:58,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:28:58,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (1/1) ... [2025-04-26 18:28:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:28:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:28:58,224 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:28:58,226 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:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:28:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:28:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:28:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:28:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:28:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:28:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:28:58,244 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:28:58,310 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:28:58,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:28:58,420 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:28:58,421 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:28:58,432 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:28:58,433 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:28:58,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:28:58 BoogieIcfgContainer [2025-04-26 18:28:58,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:28:58,433 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:28:58,433 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:28:58,437 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:28:58,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:28:58,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:28:57" (1/3) ... [2025-04-26 18:28:58,438 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2477b7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:28:58, skipping insertion in model container [2025-04-26 18:28:58,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:28:58,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:28:58" (2/3) ... [2025-04-26 18:28:58,439 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2477b7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:28:58, skipping insertion in model container [2025-04-26 18:28:58,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:28:58,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:28:58" (3/3) ... [2025-04-26 18:28:58,439 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-04-26 18:28:58,516 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:28:58,548 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:28:58,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:28:58,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:28:58,550 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:28:58,551 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:28:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 292 flow [2025-04-26 18:28:58,661 INFO L116 PetriNetUnfolderBase]: 7/124 cut-off events. [2025-04-26 18:28:58,663 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:28:58,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 124 events. 7/124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 178 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-04-26 18:28:58,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 292 flow [2025-04-26 18:28:58,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 124 transitions, 272 flow [2025-04-26 18:28:58,677 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 130 places, 124 transitions, 272 flow [2025-04-26 18:28:58,678 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 124 transitions, 272 flow [2025-04-26 18:29:02,831 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 178423 states, 178421 states have (on average 4.67207335459391) internal successors, (in total 833596), 178422 states have internal predecessors, (833596), 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:29:03,157 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 178423 states, 178421 states have (on average 4.67207335459391) internal successors, (in total 833596), 178422 states have internal predecessors, (833596), 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:29:03,160 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:29:05,785 WARN L140 AmpleReduction]: Number of pruned transitions: 117135 [2025-04-26 18:29:05,785 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:29:05,785 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3550 [2025-04-26 18:29:05,785 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:125 [2025-04-26 18:29:05,785 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:37332 [2025-04-26 18:29:05,785 WARN L145 AmpleReduction]: Times succ was already a loop node:599 [2025-04-26 18:29:05,785 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8128 [2025-04-26 18:29:05,785 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:29:05,841 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 41008 states, 41006 states have (on average 1.4105252889821003) internal successors, (in total 57840), 41007 states have internal predecessors, (57840), 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:29:05,848 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:29:05,848 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:29:05,848 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:29:05,848 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:29:05,848 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:29:05,848 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:29:05,848 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:29:05,848 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:29:05,897 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41008 states, 41006 states have (on average 1.4105252889821003) internal successors, (in total 57840), 41007 states have internal predecessors, (57840), 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:29:06,373 INFO L131 ngComponentsAnalysis]: Automaton has 1093 accepting balls. 32156 [2025-04-26 18:29:06,374 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:06,374 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:06,380 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] [2025-04-26 18:29:06,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:29:06,380 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:29:06,427 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41008 states, 41006 states have (on average 1.4105252889821003) internal successors, (in total 57840), 41007 states have internal predecessors, (57840), 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:29:06,795 INFO L131 ngComponentsAnalysis]: Automaton has 1093 accepting balls. 32156 [2025-04-26 18:29:06,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:06,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:06,796 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] [2025-04-26 18:29:06,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:29:06,802 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" [2025-04-26 18:29:06,803 INFO L754 eck$LassoCheckResult]: Loop: "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" [2025-04-26 18:29:06,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1249963208, now seen corresponding path program 1 times [2025-04-26 18:29:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:06,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921358121] [2025-04-26 18:29:06,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:06,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:29:06,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:29:06,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:06,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:29:06,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:29:06,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:06,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 849160070, now seen corresponding path program 1 times [2025-04-26 18:29:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:06,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407494229] [2025-04-26 18:29:06,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:06,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:06,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:06,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:06,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:06,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:06,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash -88792307, now seen corresponding path program 1 times [2025-04-26 18:29:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:06,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039416738] [2025-04-26 18:29:06,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:06,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:29:06,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:29:06,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:29:06,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:29:06,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:06,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:06,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:07,016 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:07,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:07,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:07,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:07,016 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:07,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:07,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:07,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:29:07,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:07,017 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:07,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,166 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:07,166 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,169 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:29:07,171 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:29:07,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,191 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,191 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_1=3} Honda state: {v_rep#funAddr~thread4.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,197 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:29:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,199 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:29:07,200 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:29:07,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,219 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,219 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,224 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:29:07,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,226 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:29:07,229 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:29:07,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,248 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,248 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,254 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:29:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,256 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:29:07,256 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:29:07,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,277 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,278 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_1=-1} Honda state: {v_rep#funAddr~thread3.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,283 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:29:07,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,286 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:29:07,287 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:29:07,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,305 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,305 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_1=-1} Honda state: {v_rep#funAddr~thread2.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,310 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:29:07,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,312 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:29:07,312 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:29:07,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,330 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,330 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_1=-1} Honda state: {v_rep#funAddr~thread4.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:29:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,337 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:29:07,338 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:29:07,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,355 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,355 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,362 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:29:07,363 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:29:07,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,382 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:29:07,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,385 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:29:07,386 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:29:07,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:07,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,412 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,413 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter1~0=0} Honda state: {~counter1~0=0} Generalized eigenvectors: [{~counter1~0=-3}, {~counter1~0=-2}, {~counter1~0=6}] Lambdas: [1, 4, 1] Nus: [0, 1] [2025-04-26 18:29:07,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:29:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,420 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:29:07,421 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:29:07,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,442 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,442 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_1=2} Honda state: {v_rep#funAddr~thread3.offset_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,447 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:29:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,449 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:29:07,449 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:29:07,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,460 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:07,461 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:07,466 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:29:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,468 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:29:07,469 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:29:07,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:07,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,487 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:29:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,489 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:29:07,490 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:29:07,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:07,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:07,553 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:07,557 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:29:07,558 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:07,558 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:07,558 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:07,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:07,558 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:07,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:07,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:07,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:29:07,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:07,558 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:07,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:07,703 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:07,707 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:07,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,709 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:29:07,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:29:07,712 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:29:07,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,733 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,740 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:29:07,742 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:29:07,743 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:29:07,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,767 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:29:07,768 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:29:07,769 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:29:07,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,785 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:29:07,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,792 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:29:07,793 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:29:07,794 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:29:07,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,817 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:29:07,818 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:29:07,820 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:29:07,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,838 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,844 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:29:07,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,846 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:29:07,848 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:29:07,849 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:29:07,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,872 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:29:07,873 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:29:07,875 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:29:07,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:07,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:07,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:07,888 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,896 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:29:07,897 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:29:07,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:29:07,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,915 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,920 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:29:07,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,922 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:29:07,923 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:29:07,923 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:29:07,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:07,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:07,938 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,943 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:29:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,945 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:29:07,946 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:29:07,948 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:29:07,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:07,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:07,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:07,960 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:07,965 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:29:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,967 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:29:07,968 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:29:07,971 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:29:07,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:07,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:07,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:07,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:07,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:07,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:07,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:07,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:07,991 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:29:07,991 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:29:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:07,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:07,996 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:29:07,997 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:29:07,997 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:08,000 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:29:08,001 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:29:08,001 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:08,001 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:08,001 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2025-04-26 18:29:08,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:08,009 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:08,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:29:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:29:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:08,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:08,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:08,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:08,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:08,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:08,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:08,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:08,158 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:29:08,175 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 18:29:08,217 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 41008 states, 41006 states have (on average 1.4105252889821003) internal successors, (in total 57840), 41007 states have internal predecessors, (57840), 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 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 states have internal predecessors, (30), 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:29:08,913 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 41008 states, 41006 states have (on average 1.4105252889821003) internal successors, (in total 57840), 41007 states have internal predecessors, (57840), 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 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 states have internal predecessors, (30), 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 98804 states and 140822 transitions. Complement of second has 10 states. [2025-04-26 18:29:08,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 states have internal predecessors, (30), 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:29:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2025-04-26 18:29:08,926 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 24 letters. Loop has 6 letters. [2025-04-26 18:29:08,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:08,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 30 letters. Loop has 6 letters. [2025-04-26 18:29:08,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:08,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 24 letters. Loop has 12 letters. [2025-04-26 18:29:08,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:08,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98804 states and 140822 transitions. [2025-04-26 18:29:09,682 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 17959 [2025-04-26 18:29:09,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98804 states to 43679 states and 61886 transitions. [2025-04-26 18:29:09,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27011 [2025-04-26 18:29:09,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29456 [2025-04-26 18:29:09,974 INFO L74 IsDeterministic]: Start isDeterministic. Operand 43679 states and 61886 transitions. [2025-04-26 18:29:09,974 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:09,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43679 states and 61886 transitions. [2025-04-26 18:29:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43679 states and 61886 transitions. [2025-04-26 18:29:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43679 to 42922. [2025-04-26 18:29:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42922 states, 42922 states have (on average 1.4220679371883882) internal successors, (in total 61038), 42921 states have internal predecessors, (61038), 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:29:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42922 states to 42922 states and 61038 transitions. [2025-04-26 18:29:10,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42922 states and 61038 transitions. [2025-04-26 18:29:10,765 INFO L438 stractBuchiCegarLoop]: Abstraction has 42922 states and 61038 transitions. [2025-04-26 18:29:10,765 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:29:10,765 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42922 states and 61038 transitions. [2025-04-26 18:29:10,883 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 17959 [2025-04-26 18:29:10,884 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:10,884 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:10,884 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] [2025-04-26 18:29:10,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:29:10,885 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" [2025-04-26 18:29:10,885 INFO L754 eck$LassoCheckResult]: Loop: "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" [2025-04-26 18:29:10,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2082927457, now seen corresponding path program 1 times [2025-04-26 18:29:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:10,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321067772] [2025-04-26 18:29:10,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:10,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:29:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:29:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:10,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:29:10,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:29:10,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:10,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:10,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:10,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -615099414, now seen corresponding path program 1 times [2025-04-26 18:29:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:10,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412295319] [2025-04-26 18:29:10,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:10,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:10,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:10,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:10,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:10,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:10,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:10,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 516634442, now seen corresponding path program 1 times [2025-04-26 18:29:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:10,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494880223] [2025-04-26 18:29:10,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:10,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:29:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:29:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:11,144 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:29:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:29:11,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494880223] [2025-04-26 18:29:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494880223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:29:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:29:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:29:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046951313] [2025-04-26 18:29:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:29:11,185 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:11,185 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:11,185 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:11,185 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:11,185 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:11,185 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,185 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:11,185 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:11,185 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:29:11,185 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:11,185 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:11,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,315 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:11,315 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,318 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:29:11,319 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:29:11,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,332 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,332 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork3_#t~post4#1=0} Honda state: {thread2Thread1of1ForFork3_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:29:11,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,340 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:29:11,341 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:29:11,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,359 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,359 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,367 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:29:11,368 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:29:11,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,386 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,386 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_3=-1} Honda state: {v_rep#funAddr~thread3.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,394 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:29:11,395 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:29:11,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,414 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,414 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,419 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:29:11,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,422 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:29:11,423 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:29:11,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,436 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,436 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=0} Honda state: {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,444 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:29:11,445 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:29:11,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,463 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,463 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_3=-1} Honda state: {v_rep#funAddr~thread4.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,469 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:29:11,470 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:29:11,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,487 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,487 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_3=3} Honda state: {v_rep#funAddr~thread4.offset_3=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,492 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:29:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,494 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:29:11,495 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:29:11,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,512 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,512 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_3=0} Honda state: {v_rep#funAddr~thread1.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,518 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:29:11,520 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:29:11,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,530 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,530 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork3_#t~post3#1=0} Honda state: {thread2Thread1of1ForFork3_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:29:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,537 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:29:11,538 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:29:11,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,555 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,555 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,560 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:29:11,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,562 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:29:11,563 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:29:11,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,581 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,581 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_3=2} Honda state: {v_rep#funAddr~thread3.offset_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,587 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:29:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,589 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:29:11,590 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:29:11,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,603 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:11,604 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=0} Honda state: {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:11,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,611 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:29:11,611 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:29:11,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:11,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 18:29:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,629 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:29:11,629 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:29:11,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:11,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:11,650 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:11,655 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:29:11,655 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:11,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:11,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:11,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:11,655 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:11,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:11,655 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:11,655 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:29:11,655 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:11,655 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:11,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:11,784 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:11,784 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:11,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,791 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:29:11,793 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:29:11,794 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:29:11,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,812 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,818 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:29:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,822 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:29:11,823 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:29:11,825 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:29:11,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:11,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:11,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:11,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,842 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:29:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,843 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:29:11,845 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:29:11,846 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:29:11,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,860 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 18:29:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,867 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:29:11,868 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:29:11,869 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:29:11,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,890 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:29:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,893 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:29:11,894 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:29:11,897 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:29:11,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,911 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 18:29:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,919 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:29:11,920 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:29:11,921 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:29:11,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:11,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:11,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:11,933 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,938 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:29:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,940 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:29:11,941 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:29:11,942 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:29:11,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,957 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:29:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,964 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:29:11,965 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:29:11,965 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:29:11,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:11,979 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:11,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:29:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:11,986 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:29:11,986 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:29:11,987 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:29:11,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:11,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:11,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:11,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:11,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:11,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:12,000 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:12,006 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:29:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:12,008 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:29:12,008 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:29:12,009 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:29:12,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:12,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:12,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:12,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:12,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:12,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:12,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:12,020 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:12,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:29:12,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:12,027 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:29:12,028 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:29:12,029 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:29:12,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:12,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:12,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:12,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:12,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:12,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:12,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:12,051 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:29:12,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:12,053 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:29:12,054 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:29:12,055 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:29:12,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:12,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:12,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:12,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:12,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:12,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:12,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:12,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:12,069 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:29:12,069 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:29:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:12,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:12,071 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:29:12,072 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:29:12,073 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:12,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:12,076 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:12,076 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:12,076 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter1~0) = 1*~counter1~0 Supporting invariants [] [2025-04-26 18:29:12,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:12,082 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:12,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:12,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:29:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:29:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:12,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:12,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:12,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:12,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:12,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:29:12,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:12,275 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:29:12,276 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 18:29:12,276 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42922 states and 61038 transitions. cyclomatic complexity: 19062 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (in total 45), 7 states have internal predecessors, (45), 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:29:12,990 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42922 states and 61038 transitions. cyclomatic complexity: 19062. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (in total 45), 7 states have internal predecessors, (45), 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 77250 states and 104913 transitions. Complement of second has 16 states. [2025-04-26 18:29:12,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (in total 45), 7 states have internal predecessors, (45), 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:29:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 380 transitions. [2025-04-26 18:29:12,991 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 380 transitions. Stem has 33 letters. Loop has 12 letters. [2025-04-26 18:29:12,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:12,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 380 transitions. Stem has 45 letters. Loop has 12 letters. [2025-04-26 18:29:12,992 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:12,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 380 transitions. Stem has 33 letters. Loop has 24 letters. [2025-04-26 18:29:12,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:12,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77250 states and 104913 transitions. [2025-04-26 18:29:13,338 INFO L131 ngComponentsAnalysis]: Automaton has 557 accepting balls. 18528 [2025-04-26 18:29:13,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77250 states to 55865 states and 77132 transitions. [2025-04-26 18:29:13,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33148 [2025-04-26 18:29:13,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33870 [2025-04-26 18:29:13,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 55865 states and 77132 transitions. [2025-04-26 18:29:13,578 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:13,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55865 states and 77132 transitions. [2025-04-26 18:29:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55865 states and 77132 transitions. [2025-04-26 18:29:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55865 to 55211. [2025-04-26 18:29:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55211 states, 55211 states have (on average 1.3836554309829563) internal successors, (in total 76393), 55210 states have internal predecessors, (76393), 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:29:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55211 states to 55211 states and 76393 transitions. [2025-04-26 18:29:14,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55211 states and 76393 transitions. [2025-04-26 18:29:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:29:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:29:14,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:29:14,338 INFO L87 Difference]: Start difference. First operand 55211 states and 76393 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (in total 45), 5 states have internal predecessors, (45), 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:29:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:29:14,617 INFO L93 Difference]: Finished difference Result 55674 states and 75599 transitions. [2025-04-26 18:29:14,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55674 states and 75599 transitions. [2025-04-26 18:29:14,848 INFO L131 ngComponentsAnalysis]: Automaton has 561 accepting balls. 17332 [2025-04-26 18:29:15,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55674 states to 54313 states and 74238 transitions. [2025-04-26 18:29:15,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32308 [2025-04-26 18:29:15,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32308 [2025-04-26 18:29:15,072 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54313 states and 74238 transitions. [2025-04-26 18:29:15,072 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:15,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54313 states and 74238 transitions. [2025-04-26 18:29:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54313 states and 74238 transitions. [2025-04-26 18:29:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54313 to 51999. [2025-04-26 18:29:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51999 states, 51999 states have (on average 1.3789880574626434) internal successors, (in total 71706), 51998 states have internal predecessors, (71706), 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:29:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51999 states to 51999 states and 71706 transitions. [2025-04-26 18:29:16,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51999 states and 71706 transitions. [2025-04-26 18:29:16,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:29:16,313 INFO L438 stractBuchiCegarLoop]: Abstraction has 51999 states and 71706 transitions. [2025-04-26 18:29:16,313 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:29:16,313 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51999 states and 71706 transitions. [2025-04-26 18:29:16,450 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 16620 [2025-04-26 18:29:16,450 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:16,450 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:16,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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] [2025-04-26 18:29:16,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:29:16,452 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" [2025-04-26 18:29:16,452 INFO L754 eck$LassoCheckResult]: Loop: "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:29:16,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash -84602361, now seen corresponding path program 1 times [2025-04-26 18:29:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:16,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518247808] [2025-04-26 18:29:16,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:16,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:29:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:29:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:16,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:29:16,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:29:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:16,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:16,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 738902456, now seen corresponding path program 2 times [2025-04-26 18:29:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:16,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623309722] [2025-04-26 18:29:16,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:29:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:16,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:16,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:16,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:29:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:16,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:16,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:16,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:16,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:16,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash 755432126, now seen corresponding path program 1 times [2025-04-26 18:29:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:16,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947465832] [2025-04-26 18:29:16,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:16,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 18:29:16,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 18:29:16,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:16,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 18:29:16,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 18:29:16,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:16,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:16,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:16,530 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:16,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:16,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:16,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:16,531 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:16,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:16,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:16,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration3_Loop [2025-04-26 18:29:16,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:16,531 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:16,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,635 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:16,635 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:16,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,639 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:29:16,640 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:29:16,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:16,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:16,657 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:16,658 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_5=-1} Honda state: {v_rep#funAddr~thread4.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:16,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,665 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:29:16,665 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:29:16,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:16,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:16,683 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:16,683 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:16,688 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:29:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,690 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:29:16,691 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:29:16,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:16,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:16,706 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:29:16,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,708 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:29:16,709 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:29:16,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:16,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:16,788 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:16,792 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:29:16,793 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:16,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:16,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:16,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:16,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:16,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:16,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:16,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration3_Loop [2025-04-26 18:29:16,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:16,793 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:16,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:16,898 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:16,898 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:16,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,900 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:29:16,901 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:29:16,902 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:29:16,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:16,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:16,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:16,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:16,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:16,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:16,914 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:16,919 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:29:16,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,921 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:29:16,921 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:29:16,922 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:29:16,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:16,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:16,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:16,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:16,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:16,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:16,934 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:16,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,942 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:29:16,943 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:29:16,943 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:29:16,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:16,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:16,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:16,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:16,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:16,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:16,956 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:16,961 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:29:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,963 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:29:16,964 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:29:16,965 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:29:16,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:16,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:16,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:16,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:16,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:16,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:16,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:16,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:16,978 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:29:16,978 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:29:16,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:16,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:16,979 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:29:16,980 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:29:16,981 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:16,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:16,984 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:16,984 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:16,984 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread2Thread1of1ForFork3_~i~1#1) = 1*~N~0 - 1*thread2Thread1of1ForFork3_~i~1#1 Supporting invariants [] [2025-04-26 18:29:16,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 18:29:16,989 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:16,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:17,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:29:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:29:17,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:17,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,092 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:29:17,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:17,093 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:17,298 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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 52500 states and 72309 transitions. Complement of second has 5 states. [2025-04-26 18:29:17,298 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:29:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-26 18:29:17,299 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 105 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 18:29:17,299 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:17,299 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:29:17,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:17,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:29:17,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:29:17,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:17,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,394 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:29:17,394 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:17,394 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:17,780 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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 52500 states and 72309 transitions. Complement of second has 5 states. [2025-04-26 18:29:17,780 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:29:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-26 18:29:17,781 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 105 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 18:29:17,781 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:17,781 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:29:17,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:17,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:29:17,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:29:17,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:17,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:17,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:17,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:17,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:17,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:17,862 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:29:17,863 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:17,863 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:18,452 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51999 states and 71706 transitions. cyclomatic complexity: 20776. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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 135637 states and 184871 transitions. Complement of second has 20 states. [2025-04-26 18:29:18,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (in total 52), 5 states have internal predecessors, (52), 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:29:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-04-26 18:29:18,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 370 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 18:29:18,453 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:18,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 370 transitions. Stem has 52 letters. Loop has 12 letters. [2025-04-26 18:29:18,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:18,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 370 transitions. Stem has 40 letters. Loop has 24 letters. [2025-04-26 18:29:18,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:18,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135637 states and 184871 transitions. [2025-04-26 18:29:19,414 INFO L131 ngComponentsAnalysis]: Automaton has 591 accepting balls. 17000 [2025-04-26 18:29:19,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135637 states to 95755 states and 129287 transitions. [2025-04-26 18:29:19,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49093 [2025-04-26 18:29:20,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50539 [2025-04-26 18:29:20,060 INFO L74 IsDeterministic]: Start isDeterministic. Operand 95755 states and 129287 transitions. [2025-04-26 18:29:20,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:20,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95755 states and 129287 transitions. [2025-04-26 18:29:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95755 states and 129287 transitions. [2025-04-26 18:29:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95755 to 78111. [2025-04-26 18:29:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78111 states, 78111 states have (on average 1.355698941250272) internal successors, (in total 105895), 78110 states have internal predecessors, (105895), 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:29:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78111 states to 78111 states and 105895 transitions. [2025-04-26 18:29:21,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78111 states and 105895 transitions. [2025-04-26 18:29:21,127 INFO L438 stractBuchiCegarLoop]: Abstraction has 78111 states and 105895 transitions. [2025-04-26 18:29:21,127 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:29:21,127 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78111 states and 105895 transitions. [2025-04-26 18:29:21,558 INFO L131 ngComponentsAnalysis]: Automaton has 482 accepting balls. 16107 [2025-04-26 18:29:21,558 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:21,558 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:21,559 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] [2025-04-26 18:29:21,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:29:21,559 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" [2025-04-26 18:29:21,559 INFO L754 eck$LassoCheckResult]: Loop: "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:29:21,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 301518024, now seen corresponding path program 1 times [2025-04-26 18:29:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:21,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85367847] [2025-04-26 18:29:21,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:21,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:29:21,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:29:21,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:21,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:21,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:21,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:29:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:29:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:21,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:21,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 738902456, now seen corresponding path program 3 times [2025-04-26 18:29:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:21,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203131908] [2025-04-26 18:29:21,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:29:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:21,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:21,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:21,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:29:21,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:21,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:21,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:21,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:21,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:21,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:21,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:21,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -619996161, now seen corresponding path program 1 times [2025-04-26 18:29:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:21,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603906466] [2025-04-26 18:29:21,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:21,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:29:21,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:29:21,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:21,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:21,732 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:29:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:29:21,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603906466] [2025-04-26 18:29:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603906466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:29:21,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:29:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 18:29:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360244271] [2025-04-26 18:29:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:29:21,756 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:21,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:21,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:21,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:21,756 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:21,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:21,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:21,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration4_Loop [2025-04-26 18:29:21,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:21,756 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:21,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:21,845 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,847 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:29:21,848 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:29:21,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:21,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,865 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:21,865 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_7=-1} Honda state: {v_rep#funAddr~thread4.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:21,870 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:29:21,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,872 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:29:21,873 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:29:21,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:21,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,890 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:21,890 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_7=-1} Honda state: {v_rep#funAddr~thread3.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:21,895 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:29:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,896 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:29:21,897 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:29:21,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:21,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,914 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:21,914 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:21,919 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:29:21,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,920 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:29:21,921 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:29:21,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:21,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,939 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:21,939 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:21,944 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:29:21,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,946 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:29:21,946 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:29:21,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:21,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 18:29:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:21,963 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:29:21,964 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:29:21,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:21,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:21,984 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:21,987 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:29:21,987 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:21,987 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:21,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:21,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:21,988 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:21,988 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:21,988 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:21,988 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:21,988 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration4_Loop [2025-04-26 18:29:21,988 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:21,988 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:21,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:21,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:22,078 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:22,078 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:22,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,080 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:29:22,080 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:29:22,082 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:29:22,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,094 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,101 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:29:22,101 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:29:22,102 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:29:22,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 18:29:22,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,121 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:29:22,122 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:29:22,123 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:29:22,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,135 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,140 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:29:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,141 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:29:22,142 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:29:22,143 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:29:22,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,155 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,160 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:29:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,162 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:29:22,163 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:29:22,164 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:29:22,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:22,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:22,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:22,175 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,182 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:29:22,184 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:29:22,185 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:29:22,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,197 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,203 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:29:22,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,204 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:29:22,205 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:29:22,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:29:22,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:22,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:22,221 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:22,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:22,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,229 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:29:22,231 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:29:22,232 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:29:22,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:22,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:22,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:22,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:22,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:22,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:22,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:22,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:22,246 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:29:22,246 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:29:22,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:22,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:22,248 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:29:22,250 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:29:22,251 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:22,254 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:29:22,254 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:22,254 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:22,254 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter1~0) = 1*~counter1~0 Supporting invariants [] [2025-04-26 18:29:22,259 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:29:22,261 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:22,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:29:22,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:29:22,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:22,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:22,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:22,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:22,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:22,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:22,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:29:22,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:22,420 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:29:22,421 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 18:29:22,421 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78111 states and 105895 transitions. cyclomatic complexity: 29169 Second operand has 6 states, 6 states have (on average 9.0) internal successors, (in total 54), 6 states have internal predecessors, (54), 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:29:23,185 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78111 states and 105895 transitions. cyclomatic complexity: 29169. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (in total 54), 6 states have internal predecessors, (54), 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 134999 states and 181820 transitions. Complement of second has 14 states. [2025-04-26 18:29:23,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (in total 54), 6 states have internal predecessors, (54), 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:29:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2025-04-26 18:29:23,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 42 letters. Loop has 12 letters. [2025-04-26 18:29:23,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:23,187 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 54 letters. Loop has 12 letters. [2025-04-26 18:29:23,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:23,187 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 42 letters. Loop has 24 letters. [2025-04-26 18:29:23,187 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:23,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134999 states and 181820 transitions. [2025-04-26 18:29:24,134 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 18:29:24,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134999 states to 87544 states and 117064 transitions. [2025-04-26 18:29:24,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23171 [2025-04-26 18:29:24,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34668 [2025-04-26 18:29:24,507 INFO L74 IsDeterministic]: Start isDeterministic. Operand 87544 states and 117064 transitions. [2025-04-26 18:29:24,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:24,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87544 states and 117064 transitions. [2025-04-26 18:29:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87544 states and 117064 transitions. [2025-04-26 18:29:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87544 to 69242. [2025-04-26 18:29:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69242 states, 69242 states have (on average 1.3656884549839692) internal successors, (in total 94563), 69241 states have internal predecessors, (94563), 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:29:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69242 states to 69242 states and 94563 transitions. [2025-04-26 18:29:25,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69242 states and 94563 transitions. [2025-04-26 18:29:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:29:25,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 18:29:25,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-26 18:29:25,701 INFO L87 Difference]: Start difference. First operand 69242 states and 94563 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (in total 54), 9 states have internal predecessors, (54), 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:29:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:29:26,148 INFO L93 Difference]: Finished difference Result 74580 states and 102717 transitions. [2025-04-26 18:29:26,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74580 states and 102717 transitions. [2025-04-26 18:29:26,698 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 18:29:26,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74580 states to 74563 states and 102698 transitions. [2025-04-26 18:29:26,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26789 [2025-04-26 18:29:27,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26803 [2025-04-26 18:29:27,004 INFO L74 IsDeterministic]: Start isDeterministic. Operand 74563 states and 102698 transitions. [2025-04-26 18:29:27,004 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:27,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74563 states and 102698 transitions. [2025-04-26 18:29:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74563 states and 102698 transitions. [2025-04-26 18:29:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74563 to 69246. [2025-04-26 18:29:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69246 states, 69246 states have (on average 1.3656817722323311) internal successors, (in total 94568), 69245 states have internal predecessors, (94568), 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:29:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69246 states to 69246 states and 94568 transitions. [2025-04-26 18:29:27,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69246 states and 94568 transitions. [2025-04-26 18:29:27,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 18:29:27,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 69246 states and 94568 transitions. [2025-04-26 18:29:27,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:29:27,996 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69246 states and 94568 transitions. [2025-04-26 18:29:28,362 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 18:29:28,362 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:28,362 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:28,363 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] [2025-04-26 18:29:28,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:29:28,364 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" [2025-04-26 18:29:28,364 INFO L754 eck$LassoCheckResult]: Loop: "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[323] L58-->L58-2: Formula: (and (= |v_thread3Thread1of1ForFork0_#t~post5_1| v_~counter2~0_9) (= (+ |v_thread3Thread1of1ForFork0_#t~post5_1| 1) v_~counter2~0_8)) InVars {~counter2~0=v_~counter2~0_9} OutVars{~counter2~0=v_~counter2~0_8, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post5]" "[325] L58-2-->L57-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5]" "[327] L57-2-->L57-3: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 |v_thread3Thread1of1ForFork0_#t~post6_1|) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[328] L57-3-->L57-4: Formula: (= (+ |v_thread3Thread1of1ForFork0_#t~post6_3| 1) v_thread3Thread1of1ForFork0_~i~2_11) InVars {thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[329] L57-4-->L57-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" [2025-04-26 18:29:28,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1483138082, now seen corresponding path program 1 times [2025-04-26 18:29:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:28,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443616284] [2025-04-26 18:29:28,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:28,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 18:29:28,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 18:29:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:28,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:28,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 18:29:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 18:29:28,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:28,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:28,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:28,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1795830662, now seen corresponding path program 1 times [2025-04-26 18:29:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:28,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150962102] [2025-04-26 18:29:28,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:28,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:28,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:28,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:28,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1029946087, now seen corresponding path program 1 times [2025-04-26 18:29:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:28,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277477412] [2025-04-26 18:29:28,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:29:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:29:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:28,446 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:29:28,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:29:28,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277477412] [2025-04-26 18:29:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277477412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:29:28,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:29:28,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:29:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182830560] [2025-04-26 18:29:28,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:29:28,464 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:28,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:28,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:28,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:28,464 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:28,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:28,464 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:28,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration5_Loop [2025-04-26 18:29:28,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:28,464 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:28,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,548 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:28,548 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,550 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:29:28,551 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:29:28,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,570 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,571 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_9=2} Honda state: {v_rep#funAddr~thread3.offset_9=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,576 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:29:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,578 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:29:28,580 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:29:28,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,600 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,600 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_9=-1} Honda state: {v_rep#funAddr~thread2.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:28,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,609 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:29:28,610 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:29:28,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,628 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,628 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_9=-1} Honda state: {v_rep#funAddr~thread3.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,635 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:29:28,635 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:29:28,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,654 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,654 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_9=-1} Honda state: {v_rep#funAddr~thread4.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,660 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:29:28,661 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:29:28,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,678 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,678 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_9=3} Honda state: {v_rep#funAddr~thread4.offset_9=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,683 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:29:28,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,685 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:29:28,686 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:29:28,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,705 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,705 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_9=1} Honda state: {v_rep#funAddr~thread2.offset_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 18:29:28,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,712 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:29:28,713 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:29:28,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,729 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:29:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,731 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:29:28,732 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:29:28,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:28,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,754 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,754 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter2~0=0} Honda state: {~counter2~0=0} Generalized eigenvectors: [{~counter2~0=3}, {~counter2~0=3}, {~counter2~0=-5}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 18:29:28,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 18:29:28,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,761 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:29:28,761 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:29:28,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,778 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,778 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_9=0} Honda state: {v_rep#funAddr~thread1.offset_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,784 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:29:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,785 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:29:28,786 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:29:28,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,797 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,797 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork0_#t~post6=0} Honda state: {thread3Thread1of1ForFork0_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 18:29:28,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,805 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:29:28,805 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:29:28,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,816 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,817 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork0_#t~post5=0} Honda state: {thread3Thread1of1ForFork0_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,822 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:29:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,824 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:29:28,824 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:29:28,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,842 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:28,842 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_9=-1} Honda state: {v_rep#funAddr~thread1.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:28,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:28,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,848 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:29:28,849 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:29:28,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:28,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,865 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:29:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:28,866 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:29:28,867 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:29:28,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:28,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:28,931 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:28,936 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:29:28,936 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:28,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:28,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:28,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:28,936 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:28,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:28,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:28,936 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:28,936 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration5_Loop [2025-04-26 18:29:28,936 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:28,936 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:28,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:28,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:29,025 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:29,026 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:29,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,028 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:29:29,029 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:29:29,029 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:29:29,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,042 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,047 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:29:29,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,049 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:29:29,049 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:29:29,050 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:29:29,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,063 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,068 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:29:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,070 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:29:29,071 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:29:29,072 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:29:29,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,091 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:29:29,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,094 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:29:29,094 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:29:29,095 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:29:29,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:29,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:29,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:29,106 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,111 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:29:29,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,113 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:29:29,114 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:29:29,115 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:29:29,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,127 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,133 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:29:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,134 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:29:29,135 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:29:29,136 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:29:29,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,154 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:29:29,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,156 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:29:29,156 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:29:29,157 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:29:29,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:29,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:29,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:29,168 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-04-26 18:29:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,175 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:29:29,176 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:29:29,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:29:29,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,195 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:29:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,197 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:29:29,198 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:29:29,199 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:29:29,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,211 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,216 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:29:29,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,218 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:29:29,219 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:29:29,220 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:29:29,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:29,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:29,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:29,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,236 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:29:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,238 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:29:29,238 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:29:29,239 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:29:29,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:29,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:29,252 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:29,258 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:29:29,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,260 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:29:29,261 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:29:29,263 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:29:29,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:29,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:29,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:29,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:29,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:29,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:29,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:29,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:29,277 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:29:29,277 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:29:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:29,278 INFO L229 MonitoredProcess]: Starting monitored process 105 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:29:29,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-04-26 18:29:29,280 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:29,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-04-26 18:29:29,283 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:29,283 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:29,283 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread3Thread1of1ForFork0_~i~2) = 1*~N~0 - 1*thread3Thread1of1ForFork0_~i~2 Supporting invariants [] [2025-04-26 18:29:29,288 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:29:29,289 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:29,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 18:29:29,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 18:29:29,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:29,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:29,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:29,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:29,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:29:29,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:29:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:29,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:29,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:29,390 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:29:29,390 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 18:29:29,390 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69246 states and 94568 transitions. cyclomatic complexity: 26473 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (in total 54), 5 states have internal predecessors, (54), 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:29:30,007 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69246 states and 94568 transitions. cyclomatic complexity: 26473. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (in total 54), 5 states have internal predecessors, (54), 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 128909 states and 176223 transitions. Complement of second has 9 states. [2025-04-26 18:29:30,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (in total 54), 5 states have internal predecessors, (54), 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:29:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2025-04-26 18:29:30,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 48 letters. Loop has 6 letters. [2025-04-26 18:29:30,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:30,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 54 letters. Loop has 6 letters. [2025-04-26 18:29:30,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:30,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 48 letters. Loop has 12 letters. [2025-04-26 18:29:30,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:30,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128909 states and 176223 transitions. [2025-04-26 18:29:30,813 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:31,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128909 states to 81817 states and 111550 transitions. [2025-04-26 18:29:31,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17568 [2025-04-26 18:29:31,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18258 [2025-04-26 18:29:31,155 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81817 states and 111550 transitions. [2025-04-26 18:29:31,156 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:31,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81817 states and 111550 transitions. [2025-04-26 18:29:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81817 states and 111550 transitions. [2025-04-26 18:29:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81817 to 81119. [2025-04-26 18:29:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81119 states, 81119 states have (on average 1.3645755001910773) internal successors, (in total 110693), 81118 states have internal predecessors, (110693), 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:29:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81119 states to 81119 states and 110693 transitions. [2025-04-26 18:29:32,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81119 states and 110693 transitions. [2025-04-26 18:29:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:29:32,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:29:32,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:29:32,548 INFO L87 Difference]: Start difference. First operand 81119 states and 110693 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (in total 54), 5 states have internal predecessors, (54), 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:29:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:29:32,786 INFO L93 Difference]: Finished difference Result 81245 states and 110824 transitions. [2025-04-26 18:29:32,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81245 states and 110824 transitions. [2025-04-26 18:29:33,350 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 624 [2025-04-26 18:29:33,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81245 states to 81245 states and 110824 transitions. [2025-04-26 18:29:33,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17746 [2025-04-26 18:29:33,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17746 [2025-04-26 18:29:33,613 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81245 states and 110824 transitions. [2025-04-26 18:29:33,613 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:33,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81245 states and 110824 transitions. [2025-04-26 18:29:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81245 states and 110824 transitions. [2025-04-26 18:29:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81245 to 81140. [2025-04-26 18:29:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81140 states, 81140 states have (on average 1.364481143702243) internal successors, (in total 110714), 81139 states have internal predecessors, (110714), 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:29:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81140 states to 81140 states and 110714 transitions. [2025-04-26 18:29:34,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81140 states and 110714 transitions. [2025-04-26 18:29:34,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:29:34,662 INFO L438 stractBuchiCegarLoop]: Abstraction has 81140 states and 110714 transitions. [2025-04-26 18:29:34,662 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:29:34,662 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81140 states and 110714 transitions. [2025-04-26 18:29:35,136 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:35,137 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:35,137 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:35,137 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] [2025-04-26 18:29:35,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:29:35,139 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[320] L57-5-->L57-6: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[]" "[322] L57-6-->L61: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[324] L61-->thread3FINAL: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base]" "[326] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[253] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[166] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[237] L82-->L82-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre16#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[171] L82-1-->L82-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks]" "[279] L82-2-->L82-3: Formula: (= |v_ULTIMATE.start_main_~t4~0#1_3| |v_ULTIMATE.start_main_#t~pre16#1_3|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[358] L82-3-->$Ultimate##0: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4| 0) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre16#1_7| v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_6|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_4|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_14|, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_8|, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#in~_argptr#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#in~_argptr#1.offset, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_~_argptr#1.offset, thread4Thread1of1ForFork2_#res#1.offset]" "[330] $Ultimate##0-->L65: Formula: (and (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1| |v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1| |v_thread4Thread1of1ForFork2_~_argptr#1.base_1|)) InVars {thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_1|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_~_argptr#1.offset]" "[331] L65-->L65-5: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" [2025-04-26 18:29:35,139 INFO L754 eck$LassoCheckResult]: Loop: "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" [2025-04-26 18:29:35,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -980020035, now seen corresponding path program 1 times [2025-04-26 18:29:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:35,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948437888] [2025-04-26 18:29:35,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:35,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:29:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:29:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:35,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:35,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:29:35,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:29:35,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:35,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:35,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1362586602, now seen corresponding path program 1 times [2025-04-26 18:29:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:35,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262355800] [2025-04-26 18:29:35,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:35,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:35,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:35,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:35,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:35,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -897038682, now seen corresponding path program 1 times [2025-04-26 18:29:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:35,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717981551] [2025-04-26 18:29:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:35,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-26 18:29:35,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-26 18:29:35,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:35,259 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:29:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:29:35,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717981551] [2025-04-26 18:29:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717981551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:29:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:29:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:29:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718110894] [2025-04-26 18:29:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:29:35,286 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:35,286 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:35,286 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:35,286 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:35,286 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:35,286 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,286 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:35,286 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:35,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration6_Loop [2025-04-26 18:29:35,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:35,286 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:35,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,377 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:35,377 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:35,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,380 INFO L229 MonitoredProcess]: Starting monitored process 106 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:29:35,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-04-26 18:29:35,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:35,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:35,393 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:35,393 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_#t~post8#1=0} Honda state: {thread4Thread1of1ForFork2_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:35,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-04-26 18:29:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,402 INFO L229 MonitoredProcess]: Starting monitored process 107 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:29:35,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-04-26 18:29:35,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:35,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:35,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-04-26 18:29:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,432 INFO L229 MonitoredProcess]: Starting monitored process 108 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:29:35,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-04-26 18:29:35,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:35,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:35,456 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:35,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-04-26 18:29:35,460 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:35,460 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:35,460 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:35,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:35,460 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:35,460 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,460 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:35,460 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:35,460 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration6_Loop [2025-04-26 18:29:35,460 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:35,460 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:35,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:35,550 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:35,550 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:35,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,552 INFO L229 MonitoredProcess]: Starting monitored process 109 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:29:35,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-04-26 18:29:35,554 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:29:35,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:35,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:35,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:35,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:35,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:35,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:35,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:35,565 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:35,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-04-26 18:29:35,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,572 INFO L229 MonitoredProcess]: Starting monitored process 110 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:29:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-04-26 18:29:35,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:29:35,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:35,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:35,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:35,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:35,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:35,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:35,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:35,584 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-04-26 18:29:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,591 INFO L229 MonitoredProcess]: Starting monitored process 111 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:29:35,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-04-26 18:29:35,593 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:29:35,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:35,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:35,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:35,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:35,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:35,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:35,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:35,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-04-26 18:29:35,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,613 INFO L229 MonitoredProcess]: Starting monitored process 112 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:29:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-04-26 18:29:35,614 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:29:35,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:35,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:35,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:35,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:35,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:35,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:35,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:35,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-04-26 18:29:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,633 INFO L229 MonitoredProcess]: Starting monitored process 113 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:29:35,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-04-26 18:29:35,634 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:29:35,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:35,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:35,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:35,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:35,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:35,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:35,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:35,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:35,648 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:29:35,649 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:29:35,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:35,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:35,650 INFO L229 MonitoredProcess]: Starting monitored process 114 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:29:35,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-04-26 18:29:35,652 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:35,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-04-26 18:29:35,655 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:35,655 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:35,655 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter2~0) = 1*~counter2~0 Supporting invariants [] [2025-04-26 18:29:35,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:35,661 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:35,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:35,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:29:35,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:29:35,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:35,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:35,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:35,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:35,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:35,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:35,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:29:35,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:35,831 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:29:35,832 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 18:29:35,832 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81140 states and 110714 transitions. cyclomatic complexity: 30742 Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (in total 72), 7 states have internal predecessors, (72), 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:29:36,910 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81140 states and 110714 transitions. cyclomatic complexity: 30742. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (in total 72), 7 states have internal predecessors, (72), 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 206473 states and 280773 transitions. Complement of second has 15 states. [2025-04-26 18:29:36,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (in total 72), 7 states have internal predecessors, (72), 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:29:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2025-04-26 18:29:36,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 285 transitions. Stem has 60 letters. Loop has 12 letters. [2025-04-26 18:29:36,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:36,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 285 transitions. Stem has 72 letters. Loop has 12 letters. [2025-04-26 18:29:36,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:36,912 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 285 transitions. Stem has 60 letters. Loop has 24 letters. [2025-04-26 18:29:36,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:36,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206473 states and 280773 transitions. [2025-04-26 18:29:38,277 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:39,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206473 states to 140689 states and 189372 transitions. [2025-04-26 18:29:39,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18427 [2025-04-26 18:29:39,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18449 [2025-04-26 18:29:39,070 INFO L74 IsDeterministic]: Start isDeterministic. Operand 140689 states and 189372 transitions. [2025-04-26 18:29:39,071 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:39,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140689 states and 189372 transitions. [2025-04-26 18:29:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140689 states and 189372 transitions. [2025-04-26 18:29:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140689 to 132348. [2025-04-26 18:29:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132348 states, 132348 states have (on average 1.3581089249554206) internal successors, (in total 179743), 132347 states have internal predecessors, (179743), 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:29:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132348 states to 132348 states and 179743 transitions. [2025-04-26 18:29:41,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132348 states and 179743 transitions. [2025-04-26 18:29:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:29:41,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:29:41,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:29:41,115 INFO L87 Difference]: Start difference. First operand 132348 states and 179743 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (in total 72), 5 states have internal predecessors, (72), 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:29:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:29:41,886 INFO L93 Difference]: Finished difference Result 132370 states and 179765 transitions. [2025-04-26 18:29:41,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132370 states and 179765 transitions. [2025-04-26 18:29:42,767 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:43,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132370 states to 132370 states and 179765 transitions. [2025-04-26 18:29:43,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18292 [2025-04-26 18:29:43,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18292 [2025-04-26 18:29:43,415 INFO L74 IsDeterministic]: Start isDeterministic. Operand 132370 states and 179765 transitions. [2025-04-26 18:29:43,415 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:43,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132370 states and 179765 transitions. [2025-04-26 18:29:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132370 states and 179765 transitions. [2025-04-26 18:29:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132370 to 132348. [2025-04-26 18:29:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132348 states, 132348 states have (on average 1.3581089249554206) internal successors, (in total 179743), 132347 states have internal predecessors, (179743), 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:29:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132348 states to 132348 states and 179743 transitions. [2025-04-26 18:29:45,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132348 states and 179743 transitions. [2025-04-26 18:29:45,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:29:45,748 INFO L438 stractBuchiCegarLoop]: Abstraction has 132348 states and 179743 transitions. [2025-04-26 18:29:45,748 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:29:45,748 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132348 states and 179743 transitions. [2025-04-26 18:29:46,327 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:46,327 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:29:46,327 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:29:46,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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] [2025-04-26 18:29:46,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:29:46,329 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[253] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[166] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[237] L82-->L82-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre16#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[171] L82-1-->L82-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks]" "[279] L82-2-->L82-3: Formula: (= |v_ULTIMATE.start_main_~t4~0#1_3| |v_ULTIMATE.start_main_#t~pre16#1_3|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[358] L82-3-->$Ultimate##0: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4| 0) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre16#1_7| v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_6|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_4|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_14|, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_8|, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#in~_argptr#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#in~_argptr#1.offset, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_~_argptr#1.offset, thread4Thread1of1ForFork2_#res#1.offset]" "[330] $Ultimate##0-->L65: Formula: (and (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1| |v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1| |v_thread4Thread1of1ForFork2_~_argptr#1.base_1|)) InVars {thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_1|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_~_argptr#1.offset]" "[331] L65-->L65-5: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[323] L58-->L58-2: Formula: (and (= |v_thread3Thread1of1ForFork0_#t~post5_1| v_~counter2~0_9) (= (+ |v_thread3Thread1of1ForFork0_#t~post5_1| 1) v_~counter2~0_8)) InVars {~counter2~0=v_~counter2~0_9} OutVars{~counter2~0=v_~counter2~0_8, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post5]" "[325] L58-2-->L57-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5]" "[327] L57-2-->L57-3: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 |v_thread3Thread1of1ForFork0_#t~post6_1|) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[328] L57-3-->L57-4: Formula: (= (+ |v_thread3Thread1of1ForFork0_#t~post6_3| 1) v_thread3Thread1of1ForFork0_~i~2_11) InVars {thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[329] L57-4-->L57-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" [2025-04-26 18:29:46,330 INFO L754 eck$LassoCheckResult]: Loop: "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" [2025-04-26 18:29:46,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1427870519, now seen corresponding path program 1 times [2025-04-26 18:29:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:46,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670521204] [2025-04-26 18:29:46,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:46,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:29:46,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:29:46,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:46,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:29:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:29:46,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670521204] [2025-04-26 18:29:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670521204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:29:46,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815197401] [2025-04-26 18:29:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:29:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:29:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,394 INFO L229 MonitoredProcess]: Starting monitored process 115 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:29:46,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-26 18:29:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:29:46,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:29:46,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:29:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:29:46,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:29:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:29:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815197401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:29:46,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:29:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-26 18:29:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509052815] [2025-04-26 18:29:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:29:46,508 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:29:46,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 2 times [2025-04-26 18:29:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:29:46,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653407253] [2025-04-26 18:29:46,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:29:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:29:46,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:46,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:46,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:29:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:46,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:29:46,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:29:46,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:29:46,548 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:46,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:46,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:46,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:46,549 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:29:46,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:46,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:46,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration7_Loop [2025-04-26 18:29:46,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:46,549 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:46,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,645 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:46,645 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:29:46,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,648 INFO L229 MonitoredProcess]: Starting monitored process 116 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:29:46,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-04-26 18:29:46,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:46,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,661 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:46,661 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Honda state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:46,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,669 INFO L229 MonitoredProcess]: Starting monitored process 117 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:29:46,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-04-26 18:29:46,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:46,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,689 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:46,689 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_13=-1} Honda state: {v_rep#funAddr~thread4.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:46,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,697 INFO L229 MonitoredProcess]: Starting monitored process 118 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:29:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-04-26 18:29:46,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:46,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,716 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:46,717 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_13=0} Honda state: {v_rep#funAddr~thread1.offset_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:46,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:46,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,725 INFO L229 MonitoredProcess]: Starting monitored process 119 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:29:46,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-04-26 18:29:46,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:46,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,744 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:29:46,745 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_13=-1} Honda state: {v_rep#funAddr~thread1.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:29:46,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-04-26 18:29:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,752 INFO L229 MonitoredProcess]: Starting monitored process 120 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:29:46,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-04-26 18:29:46,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:29:46,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-04-26 18:29:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,773 INFO L229 MonitoredProcess]: Starting monitored process 121 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:29:46,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-04-26 18:29:46,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:29:46,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:29:46,868 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:29:46,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-04-26 18:29:46,873 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:29:46,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:29:46,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:29:46,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:29:46,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:29:46,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:29:46,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:29:46,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration7_Loop [2025-04-26 18:29:46,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:29:46,874 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:29:46,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:29:46,964 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:29:46,964 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:29:46,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,966 INFO L229 MonitoredProcess]: Starting monitored process 122 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:29:46,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-04-26 18:29:46,968 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:29:46,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:46,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:46,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:46,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:46,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:46,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:46,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:46,981 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:46,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-04-26 18:29:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:46,988 INFO L229 MonitoredProcess]: Starting monitored process 123 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:29:46,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-04-26 18:29:46,990 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:29:46,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:46,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:46,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:46,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:46,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:47,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:47,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:47,001 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:47,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-04-26 18:29:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:47,008 INFO L229 MonitoredProcess]: Starting monitored process 124 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:29:47,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-04-26 18:29:47,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:29:47,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:47,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:47,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:47,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:47,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:47,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:47,022 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:47,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-04-26 18:29:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:47,029 INFO L229 MonitoredProcess]: Starting monitored process 125 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:29:47,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-04-26 18:29:47,031 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:29:47,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:47,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:47,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:47,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:47,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:47,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:47,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:47,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-04-26 18:29:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:47,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:47,052 INFO L229 MonitoredProcess]: Starting monitored process 126 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:29:47,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-04-26 18:29:47,054 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:29:47,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:47,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:47,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:47,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:47,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:29:47,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:29:47,066 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:29:47,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-04-26 18:29:47,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:47,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:47,073 INFO L229 MonitoredProcess]: Starting monitored process 127 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:29:47,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-04-26 18:29:47,075 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:29:47,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:29:47,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:29:47,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:29:47,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:29:47,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:29:47,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:29:47,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:29:47,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:29:47,089 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:29:47,089 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:29:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:29:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:29:47,092 INFO L229 MonitoredProcess]: Starting monitored process 128 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:29:47,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-04-26 18:29:47,093 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:29:47,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-04-26 18:29:47,096 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:29:47,096 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:29:47,096 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread4Thread1of1ForFork2_~i~3#1) = 1*~N~0 - 1*thread4Thread1of1ForFork2_~i~3#1 Supporting invariants [] [2025-04-26 18:29:47,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-04-26 18:29:47,102 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:29:47,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:47,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:29:47,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:29:47,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:47,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:47,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:47,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:47,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:47,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:47,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:47,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:47,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:47,205 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:29:47,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:47,206 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246 Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:48,696 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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 304622 states and 413791 transitions. Complement of second has 11 states. [2025-04-26 18:29:48,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2025-04-26 18:29:48,698 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 302 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 18:29:48,698 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:48,698 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:29:48,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:29:48,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:29:48,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:48,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:48,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:48,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:48,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:48,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:48,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:48,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:48,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:48,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:48,809 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:29:48,810 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:48,810 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246 Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:49,992 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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 304622 states and 413791 transitions. Complement of second has 11 states. [2025-04-26 18:29:49,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2025-04-26 18:29:49,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 302 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 18:29:49,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:49,993 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:29:50,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:29:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:29:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:29:50,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:50,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:29:50,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:50,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:29:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:29:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:29:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:29:50,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:29:50,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:29:50,149 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:29:50,150 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:29:50,150 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246 Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:52,260 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132348 states and 179743 transitions. cyclomatic complexity: 50246. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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 406060 states and 548579 transitions. Complement of second has 37 states. [2025-04-26 18:29:52,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:29:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (in total 82), 5 states have internal predecessors, (82), 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:29:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 319 transitions. [2025-04-26 18:29:52,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 18:29:52,261 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:52,261 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 82 letters. Loop has 12 letters. [2025-04-26 18:29:52,262 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:52,262 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 70 letters. Loop has 24 letters. [2025-04-26 18:29:52,262 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:29:52,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 406060 states and 548579 transitions. [2025-04-26 18:29:54,947 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:29:55,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 406060 states to 112398 states and 149808 transitions. [2025-04-26 18:29:55,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15357 [2025-04-26 18:29:55,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21149 [2025-04-26 18:29:55,440 INFO L74 IsDeterministic]: Start isDeterministic. Operand 112398 states and 149808 transitions. [2025-04-26 18:29:55,440 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:55,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112398 states and 149808 transitions. [2025-04-26 18:29:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112398 states and 149808 transitions. [2025-04-26 18:29:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112398 to 99767. [2025-04-26 18:29:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99767 states, 99767 states have (on average 1.3347399440696823) internal successors, (in total 133163), 99766 states have internal predecessors, (133163), 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:29:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99767 states to 99767 states and 133163 transitions. [2025-04-26 18:29:56,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99767 states and 133163 transitions. [2025-04-26 18:29:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:29:56,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 18:29:56,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-26 18:29:56,980 INFO L87 Difference]: Start difference. First operand 99767 states and 133163 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (in total 78), 9 states have internal predecessors, (78), 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:29:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:29:57,653 INFO L93 Difference]: Finished difference Result 106086 states and 140921 transitions. [2025-04-26 18:29:57,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106086 states and 140921 transitions. [2025-04-26 18:29:58,070 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 696 [2025-04-26 18:29:58,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106086 states to 106077 states and 140907 transitions. [2025-04-26 18:29:58,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19752 [2025-04-26 18:29:58,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19752 [2025-04-26 18:29:58,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106077 states and 140907 transitions. [2025-04-26 18:29:58,703 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:29:58,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106077 states and 140907 transitions. [2025-04-26 18:29:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106077 states and 140907 transitions. [2025-04-26 18:29:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106077 to 99759. [2025-04-26 18:29:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99759 states, 99759 states have (on average 1.3346865946932107) internal successors, (in total 133147), 99758 states have internal predecessors, (133147), 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:29:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99759 states to 99759 states and 133147 transitions. [2025-04-26 18:29:59,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99759 states and 133147 transitions. [2025-04-26 18:29:59,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 18:29:59,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 99759 states and 133147 transitions. [2025-04-26 18:29:59,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:29:59,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99759 states and 133147 transitions. [2025-04-26 18:30:00,408 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 18:30:00,408 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:30:00,408 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:30:00,410 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] [2025-04-26 18:30:00,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:30:00,410 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[253] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[166] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[237] L82-->L82-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre16#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[171] L82-1-->L82-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks]" "[279] L82-2-->L82-3: Formula: (= |v_ULTIMATE.start_main_~t4~0#1_3| |v_ULTIMATE.start_main_#t~pre16#1_3|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[358] L82-3-->$Ultimate##0: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4| 0) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre16#1_7| v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_6|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_4|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_14|, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_8|, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#in~_argptr#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#in~_argptr#1.offset, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_~_argptr#1.offset, thread4Thread1of1ForFork2_#res#1.offset]" "[330] $Ultimate##0-->L65: Formula: (and (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1| |v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1| |v_thread4Thread1of1ForFork2_~_argptr#1.base_1|)) InVars {thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_1|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_~_argptr#1.offset]" "[331] L65-->L65-5: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[323] L58-->L58-2: Formula: (and (= |v_thread3Thread1of1ForFork0_#t~post5_1| v_~counter2~0_9) (= (+ |v_thread3Thread1of1ForFork0_#t~post5_1| 1) v_~counter2~0_8)) InVars {~counter2~0=v_~counter2~0_9} OutVars{~counter2~0=v_~counter2~0_8, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post5]" "[325] L58-2-->L57-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5]" "[327] L57-2-->L57-3: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 |v_thread3Thread1of1ForFork0_#t~post6_1|) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[328] L57-3-->L57-4: Formula: (= (+ |v_thread3Thread1of1ForFork0_#t~post6_3| 1) v_thread3Thread1of1ForFork0_~i~2_11) InVars {thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[329] L57-4-->L57-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[320] L57-5-->L57-6: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[]" "[322] L57-6-->L61: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[324] L61-->thread3FINAL: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base]" [2025-04-26 18:30:00,411 INFO L754 eck$LassoCheckResult]: Loop: "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" [2025-04-26 18:30:00,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -385729463, now seen corresponding path program 1 times [2025-04-26 18:30:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:00,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132495507] [2025-04-26 18:30:00,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:30:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:00,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 18:30:00,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:30:00,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:00,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:30:00,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 18:30:00,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:30:00,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:00,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:30:00,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 3 times [2025-04-26 18:30:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:00,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293966308] [2025-04-26 18:30:00,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:30:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:00,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:00,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:00,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:30:00,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:00,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:30:00,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:00,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:00,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:00,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:00,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:30:00,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash -498210304, now seen corresponding path program 1 times [2025-04-26 18:30:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:00,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671356267] [2025-04-26 18:30:00,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:30:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-26 18:30:00,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-26 18:30:00,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:30:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:30:00,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671356267] [2025-04-26 18:30:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671356267] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:30:00,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712295188] [2025-04-26 18:30:00,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:30:00,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:30:00,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:00,571 INFO L229 MonitoredProcess]: Starting monitored process 129 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:30:00,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-26 18:30:00,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-26 18:30:00,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-26 18:30:00,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:00,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 18:30:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:30:00,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:30:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:30:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712295188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:30:00,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:30:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-26 18:30:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006516213] [2025-04-26 18:30:00,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:30:00,880 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:00,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:00,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:00,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:00,880 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:30:00,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:00,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:00,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:00,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration8_Loop [2025-04-26 18:30:00,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:00,880 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:00,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:00,978 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:00,978 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:30:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:00,980 INFO L229 MonitoredProcess]: Starting monitored process 130 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:30:00,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-04-26 18:30:00,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:00,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:00,998 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:00,998 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_15=3} Honda state: {v_rep#funAddr~thread4.offset_15=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:01,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-04-26 18:30:01,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,005 INFO L229 MonitoredProcess]: Starting monitored process 131 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:30:01,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-04-26 18:30:01,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:01,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:01,023 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:01,023 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_15=-1} Honda state: {v_rep#funAddr~thread4.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:01,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,030 INFO L229 MonitoredProcess]: Starting monitored process 132 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:30:01,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-04-26 18:30:01,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:01,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:01,047 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:01,048 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_15=-1} Honda state: {v_rep#funAddr~thread1.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:01,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-04-26 18:30:01,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,055 INFO L229 MonitoredProcess]: Starting monitored process 133 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:30:01,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-04-26 18:30:01,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:01,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:01,073 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:01,073 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_15=-1} Honda state: {v_rep#funAddr~thread3.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:01,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-04-26 18:30:01,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,080 INFO L229 MonitoredProcess]: Starting monitored process 134 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:30:01,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-04-26 18:30:01,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:01,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:01,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-04-26 18:30:01,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,098 INFO L229 MonitoredProcess]: Starting monitored process 135 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:30:01,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-04-26 18:30:01,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:30:01,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:01,119 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:30:01,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-04-26 18:30:01,123 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:01,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:01,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:01,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:01,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:30:01,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:01,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:01,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration8_Loop [2025-04-26 18:30:01,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:01,123 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:01,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:01,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:01,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:30:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,204 INFO L229 MonitoredProcess]: Starting monitored process 136 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:30:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-04-26 18:30:01,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:01,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:01,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:01,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:01,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:01,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:01,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:01,218 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:01,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-04-26 18:30:01,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,224 INFO L229 MonitoredProcess]: Starting monitored process 137 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:30:01,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-04-26 18:30:01,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:01,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:01,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:01,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:01,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:01,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:01,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:01,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:01,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-04-26 18:30:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,244 INFO L229 MonitoredProcess]: Starting monitored process 138 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:30:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-04-26 18:30:01,246 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:30:01,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:01,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:01,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:01,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:01,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:01,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:01,258 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:01,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-04-26 18:30:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,268 INFO L229 MonitoredProcess]: Starting monitored process 139 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:30:01,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-04-26 18:30:01,272 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:30:01,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:01,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:01,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:01,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:01,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:01,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:01,284 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:01,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,292 INFO L229 MonitoredProcess]: Starting monitored process 140 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:30:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-04-26 18:30:01,294 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:30:01,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:01,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:01,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:01,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:01,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:01,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:01,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:01,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:30:01,307 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:30:01,307 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:30:01,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:01,309 INFO L229 MonitoredProcess]: Starting monitored process 141 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:30:01,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-04-26 18:30:01,312 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:30:01,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:01,315 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:30:01,315 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:30:01,315 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter2~0) = 1*~counter2~0 Supporting invariants [] [2025-04-26 18:30:01,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:01,320 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:30:01,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:01,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 18:30:01,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 18:30:01,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:01,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:01,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:30:01,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:01,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:01,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:01,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:01,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:01,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:30:01,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:01,509 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:30:01,509 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 18:30:01,509 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99759 states and 133147 transitions. cyclomatic complexity: 35066 Second operand has 6 states, 6 states have (on average 16.0) internal successors, (in total 96), 6 states have internal predecessors, (96), 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:30:02,197 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99759 states and 133147 transitions. cyclomatic complexity: 35066. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (in total 96), 6 states have internal predecessors, (96), 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 116523 states and 155398 transitions. Complement of second has 14 states. [2025-04-26 18:30:02,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 18:30:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 16.0) internal successors, (in total 96), 6 states have internal predecessors, (96), 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:30:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2025-04-26 18:30:02,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 277 transitions. Stem has 84 letters. Loop has 12 letters. [2025-04-26 18:30:02,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:02,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 277 transitions. Stem has 96 letters. Loop has 12 letters. [2025-04-26 18:30:02,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:02,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 277 transitions. Stem has 84 letters. Loop has 24 letters. [2025-04-26 18:30:02,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:02,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116523 states and 155398 transitions. [2025-04-26 18:30:02,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:03,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116523 states to 66735 states and 86883 transitions. [2025-04-26 18:30:03,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2185 [2025-04-26 18:30:03,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2811 [2025-04-26 18:30:03,116 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66735 states and 86883 transitions. [2025-04-26 18:30:03,116 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:30:03,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66735 states and 86883 transitions. [2025-04-26 18:30:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66735 states and 86883 transitions. [2025-04-26 18:30:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66735 to 52987. [2025-04-26 18:30:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52987 states, 52987 states have (on average 1.3187196859607073) internal successors, (in total 69875), 52986 states have internal predecessors, (69875), 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:30:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52987 states to 52987 states and 69875 transitions. [2025-04-26 18:30:03,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52987 states and 69875 transitions. [2025-04-26 18:30:03,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:30:03,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-26 18:30:03,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-26 18:30:03,960 INFO L87 Difference]: Start difference. First operand 52987 states and 69875 transitions. Second operand has 16 states, 15 states have (on average 9.6) internal successors, (in total 144), 16 states have internal predecessors, (144), 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:30:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:30:04,331 INFO L93 Difference]: Finished difference Result 62972 states and 81834 transitions. [2025-04-26 18:30:04,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62972 states and 81834 transitions. [2025-04-26 18:30:04,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:04,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62972 states to 53155 states and 70066 transitions. [2025-04-26 18:30:04,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2636 [2025-04-26 18:30:04,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2636 [2025-04-26 18:30:04,699 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53155 states and 70066 transitions. [2025-04-26 18:30:04,700 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:30:04,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53155 states and 70066 transitions. [2025-04-26 18:30:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53155 states and 70066 transitions. [2025-04-26 18:30:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53155 to 53011. [2025-04-26 18:30:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53011 states, 53011 states have (on average 1.3185753900133934) internal successors, (in total 69899), 53010 states have internal predecessors, (69899), 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:30:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53011 states to 53011 states and 69899 transitions. [2025-04-26 18:30:05,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53011 states and 69899 transitions. [2025-04-26 18:30:05,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 18:30:05,484 INFO L438 stractBuchiCegarLoop]: Abstraction has 53011 states and 69899 transitions. [2025-04-26 18:30:05,484 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:30:05,484 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53011 states and 69899 transitions. [2025-04-26 18:30:05,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:05,762 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:30:05,762 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:30:05,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-04-26 18:30:05,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:30:05,764 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[253] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[166] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[237] L82-->L82-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre16#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[171] L82-1-->L82-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks]" "[279] L82-2-->L82-3: Formula: (= |v_ULTIMATE.start_main_~t4~0#1_3| |v_ULTIMATE.start_main_#t~pre16#1_3|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[358] L82-3-->$Ultimate##0: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4| 0) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre16#1_7| v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_6|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_4|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_14|, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_8|, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#in~_argptr#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#in~_argptr#1.offset, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_~_argptr#1.offset, thread4Thread1of1ForFork2_#res#1.offset]" "[330] $Ultimate##0-->L65: Formula: (and (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1| |v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1| |v_thread4Thread1of1ForFork2_~_argptr#1.base_1|)) InVars {thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_1|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_~_argptr#1.offset]" "[331] L65-->L65-5: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[323] L58-->L58-2: Formula: (and (= |v_thread3Thread1of1ForFork0_#t~post5_1| v_~counter2~0_9) (= (+ |v_thread3Thread1of1ForFork0_#t~post5_1| 1) v_~counter2~0_8)) InVars {~counter2~0=v_~counter2~0_9} OutVars{~counter2~0=v_~counter2~0_8, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post5]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[325] L58-2-->L57-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5]" "[327] L57-2-->L57-3: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 |v_thread3Thread1of1ForFork0_#t~post6_1|) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[328] L57-3-->L57-4: Formula: (= (+ |v_thread3Thread1of1ForFork0_#t~post6_3| 1) v_thread3Thread1of1ForFork0_~i~2_11) InVars {thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[329] L57-4-->L57-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:30:05,764 INFO L754 eck$LassoCheckResult]: Loop: "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" [2025-04-26 18:30:05,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 788118697, now seen corresponding path program 1 times [2025-04-26 18:30:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:05,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700968771] [2025-04-26 18:30:05,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:30:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:05,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 18:30:05,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 18:30:05,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:05,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:30:05,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:30:05,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700968771] [2025-04-26 18:30:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700968771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:30:05,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048563194] [2025-04-26 18:30:05,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:30:05,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:30:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,000 INFO L229 MonitoredProcess]: Starting monitored process 142 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:30:06,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-04-26 18:30:06,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 18:30:06,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 18:30:06,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:06,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:06,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 18:30:06,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:30:06,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 18:30:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048563194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:30:06,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 18:30:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 33 [2025-04-26 18:30:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912735754] [2025-04-26 18:30:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:30:06,448 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:30:06,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 4 times [2025-04-26 18:30:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:06,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847465729] [2025-04-26 18:30:06,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:30:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:06,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-04-26 18:30:06,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:06,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:30:06,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:06,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:30:06,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:06,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:06,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:06,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:30:06,479 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:06,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:06,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:06,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:06,479 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:30:06,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,479 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:06,479 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:06,479 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration9_Loop [2025-04-26 18:30:06,479 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:06,479 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:06,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,576 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:06,576 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:30:06,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,579 INFO L229 MonitoredProcess]: Starting monitored process 143 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:30:06,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-04-26 18:30:06,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,592 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,592 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Honda state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,600 INFO L229 MonitoredProcess]: Starting monitored process 144 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:30:06,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-04-26 18:30:06,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,618 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,618 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_17=3} Honda state: {v_rep#funAddr~thread4.offset_17=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-04-26 18:30:06,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,625 INFO L229 MonitoredProcess]: Starting monitored process 145 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:30:06,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-04-26 18:30:06,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,643 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,643 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_17=2} Honda state: {v_rep#funAddr~thread3.offset_17=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-04-26 18:30:06,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,650 INFO L229 MonitoredProcess]: Starting monitored process 146 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:30:06,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-04-26 18:30:06,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,668 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,669 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_17=0} Honda state: {v_rep#funAddr~thread1.offset_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-04-26 18:30:06,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,676 INFO L229 MonitoredProcess]: Starting monitored process 147 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:30:06,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-04-26 18:30:06,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,693 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,694 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_17=-1} Honda state: {v_rep#funAddr~thread4.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-04-26 18:30:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,701 INFO L229 MonitoredProcess]: Starting monitored process 148 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:30:06,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-04-26 18:30:06,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,718 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,719 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_17=-1} Honda state: {v_rep#funAddr~thread3.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-04-26 18:30:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,726 INFO L229 MonitoredProcess]: Starting monitored process 149 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:30:06,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-04-26 18:30:06,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,743 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,744 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_17=1} Honda state: {v_rep#funAddr~thread2.offset_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:06,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,750 INFO L229 MonitoredProcess]: Starting monitored process 150 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:30:06,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-04-26 18:30:06,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,762 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,762 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_#t~post7#1=0} Honda state: {thread4Thread1of1ForFork2_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-04-26 18:30:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,769 INFO L229 MonitoredProcess]: Starting monitored process 151 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:30:06,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-04-26 18:30:06,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,786 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,787 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_17=-1} Honda state: {v_rep#funAddr~thread2.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,794 INFO L229 MonitoredProcess]: Starting monitored process 152 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:30:06,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-04-26 18:30:06,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,806 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,806 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=0} Honda state: {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,813 INFO L229 MonitoredProcess]: Starting monitored process 153 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:30:06,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-04-26 18:30:06,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,831 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:06,831 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_17=-1} Honda state: {v_rep#funAddr~thread1.base_17=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:06,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-04-26 18:30:06,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,838 INFO L229 MonitoredProcess]: Starting monitored process 154 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:30:06,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-04-26 18:30:06,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:06,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-04-26 18:30:06,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:06,857 INFO L229 MonitoredProcess]: Starting monitored process 155 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:30:06,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-04-26 18:30:06,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:30:06,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:06,948 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:30:06,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:06,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:06,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:06,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:06,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:06,953 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:30:06,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:06,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:06,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:06,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration9_Loop [2025-04-26 18:30:06,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:06,953 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:06,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:06,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:07,036 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:07,036 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:30:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,038 INFO L229 MonitoredProcess]: Starting monitored process 156 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:30:07,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-04-26 18:30:07,044 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:30:07,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:07,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:07,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:07,056 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-04-26 18:30:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,063 INFO L229 MonitoredProcess]: Starting monitored process 157 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:30:07,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-04-26 18:30:07,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:07,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-04-26 18:30:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,085 INFO L229 MonitoredProcess]: Starting monitored process 158 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:30:07,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-04-26 18:30:07,087 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:30:07,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:07,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:07,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:07,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-04-26 18:30:07,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,106 INFO L229 MonitoredProcess]: Starting monitored process 159 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:30:07,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-04-26 18:30:07,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:07,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-04-26 18:30:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,127 INFO L229 MonitoredProcess]: Starting monitored process 160 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:30:07,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-04-26 18:30:07,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:07,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:07,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,149 INFO L229 MonitoredProcess]: Starting monitored process 161 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:30:07,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-04-26 18:30:07,151 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:30:07,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,172 INFO L229 MonitoredProcess]: Starting monitored process 162 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:30:07,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-04-26 18:30:07,173 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:30:07,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-04-26 18:30:07,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,192 INFO L229 MonitoredProcess]: Starting monitored process 163 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:30:07,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-04-26 18:30:07,194 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:30:07,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,206 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-04-26 18:30:07,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,213 INFO L229 MonitoredProcess]: Starting monitored process 164 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:30:07,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-04-26 18:30:07,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:07,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,227 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-04-26 18:30:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,233 INFO L229 MonitoredProcess]: Starting monitored process 165 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:30:07,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-04-26 18:30:07,235 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:30:07,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:07,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:07,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:07,246 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-04-26 18:30:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,253 INFO L229 MonitoredProcess]: Starting monitored process 166 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:30:07,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-04-26 18:30:07,254 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:30:07,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:07,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:07,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:07,265 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-04-26 18:30:07,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,272 INFO L229 MonitoredProcess]: Starting monitored process 167 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:30:07,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-04-26 18:30:07,273 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:30:07,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:07,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:07,285 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:07,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-04-26 18:30:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,292 INFO L229 MonitoredProcess]: Starting monitored process 168 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:30:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-04-26 18:30:07,294 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:30:07,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:07,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:07,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:07,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:07,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:07,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:07,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:07,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:30:07,307 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:30:07,307 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:30:07,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:07,309 INFO L229 MonitoredProcess]: Starting monitored process 169 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:30:07,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-04-26 18:30:07,310 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:30:07,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-04-26 18:30:07,313 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:30:07,313 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:30:07,313 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread4Thread1of1ForFork2_~i~3#1, ~N~0) = -1*thread4Thread1of1ForFork2_~i~3#1 + 1*~N~0 Supporting invariants [] [2025-04-26 18:30:07,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-04-26 18:30:07,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:30:07,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:07,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 18:30:07,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 18:30:07,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:07,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:30:07,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:07,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:07,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:07,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:07,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:07,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:30:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:07,561 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:30:07,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:30:07,561 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53011 states and 69899 transitions. cyclomatic complexity: 18147 Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:30:07,842 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53011 states and 69899 transitions. cyclomatic complexity: 18147. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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 63542 states and 84701 transitions. Complement of second has 11 states. [2025-04-26 18:30:07,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:30:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:30:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-04-26 18:30:07,843 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 142 letters. Loop has 12 letters. [2025-04-26 18:30:07,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:07,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 154 letters. Loop has 12 letters. [2025-04-26 18:30:07,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:07,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 142 letters. Loop has 24 letters. [2025-04-26 18:30:07,844 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:07,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63542 states and 84701 transitions. [2025-04-26 18:30:08,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:08,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63542 states to 17730 states and 25503 transitions. [2025-04-26 18:30:08,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2025-04-26 18:30:08,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2025-04-26 18:30:08,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17730 states and 25503 transitions. [2025-04-26 18:30:08,119 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:30:08,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17730 states and 25503 transitions. [2025-04-26 18:30:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17730 states and 25503 transitions. [2025-04-26 18:30:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17730 to 16904. [2025-04-26 18:30:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16904 states, 16904 states have (on average 1.4451017510648367) internal successors, (in total 24428), 16903 states have internal predecessors, (24428), 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:30:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16904 states to 16904 states and 24428 transitions. [2025-04-26 18:30:08,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16904 states and 24428 transitions. [2025-04-26 18:30:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:30:08,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-26 18:30:08,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2025-04-26 18:30:08,293 INFO L87 Difference]: Start difference. First operand 16904 states and 24428 transitions. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (in total 142), 19 states have internal predecessors, (142), 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:30:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:30:09,134 INFO L93 Difference]: Finished difference Result 29289 states and 40992 transitions. [2025-04-26 18:30:09,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29289 states and 40992 transitions. [2025-04-26 18:30:09,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:09,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29289 states to 26454 states and 37442 transitions. [2025-04-26 18:30:09,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2025-04-26 18:30:09,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2025-04-26 18:30:09,281 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26454 states and 37442 transitions. [2025-04-26 18:30:09,281 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:30:09,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26454 states and 37442 transitions. [2025-04-26 18:30:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26454 states and 37442 transitions. [2025-04-26 18:30:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26454 to 19436. [2025-04-26 18:30:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19436 states, 19436 states have (on average 1.419685120395143) internal successors, (in total 27593), 19435 states have internal predecessors, (27593), 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:30:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 27593 transitions. [2025-04-26 18:30:09,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19436 states and 27593 transitions. [2025-04-26 18:30:09,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-26 18:30:09,490 INFO L438 stractBuchiCegarLoop]: Abstraction has 19436 states and 27593 transitions. [2025-04-26 18:30:09,491 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:30:09,491 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19436 states and 27593 transitions. [2025-04-26 18:30:09,536 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 18:30:09,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:30:09,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:30:09,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-04-26 18:30:09,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:30:09,538 INFO L752 eck$LassoCheckResult]: Stem: "[186] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[198] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[247] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[267] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[234] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[225] L21-4-->L37: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0]" "[219] L37-->L37-1: Formula: (= v_~counter1~0_6 0) InVars {} OutVars{~counter1~0=v_~counter1~0_6} AuxVars[] AssignedVars[~counter1~0]" "[220] L37-1-->L-1-1: Formula: (= v_~counter2~0_3 0) InVars {} OutVars{~counter2~0=v_~counter2~0_3} AuxVars[] AssignedVars[~counter2~0]" "[276] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[278] L-1-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, 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_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[233] L74-->L74-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[251] L74-1-->L74-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[254] L74-2-->L74-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[285] L74-3-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[227] L76-->L76-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N~0_8) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[~N~0]" "[273] L76-2-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[212] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[263] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[194] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre10#1_3|) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[355] L79-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_7|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_7|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[286] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[287] L40-->L40-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[221] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1]" "[175] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[170] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[264] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[178] L80-2-->L80-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre12#1_3|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[361] L80-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4| 0) (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_8|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_14|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_6|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_4|, thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_4|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#in~_argptr#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#in~_argptr#1.base, thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[298] $Ultimate##0-->L48: Formula: (and (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork3_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1| |v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork3_~_argptr#1.offset=|v_thread2Thread1of1ForFork3_~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork3_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork3_#in~_argptr#1.base=|v_thread2Thread1of1ForFork3_#in~_argptr#1.base_1|, thread2Thread1of1ForFork3_~_argptr#1.base=|v_thread2Thread1of1ForFork3_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~_argptr#1.offset, thread2Thread1of1ForFork3_~_argptr#1.base]" "[299] L48-->L48-5: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[213] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[255] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[274] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[165] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[244] L81-2-->L81-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre14#1_3|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[352] L81-3-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_4|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_4, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_8|, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_6|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#in~_argptr.base, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0, thread3Thread1of1ForFork0_~_argptr.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_#t~post6, thread3Thread1of1ForFork0_#t~post5, thread3Thread1of1ForFork0_#in~_argptr.offset]" "[318] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#in~_argptr.offset_1| v_thread3Thread1of1ForFork0_~_argptr.offset_1) (= |v_thread3Thread1of1ForFork0_#in~_argptr.base_1| v_thread3Thread1of1ForFork0_~_argptr.base_1)) InVars {thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork0_#in~_argptr.base=|v_thread3Thread1of1ForFork0_#in~_argptr.base_1|, thread3Thread1of1ForFork0_~_argptr.base=v_thread3Thread1of1ForFork0_~_argptr.base_1, thread3Thread1of1ForFork0_#in~_argptr.offset=|v_thread3Thread1of1ForFork0_#in~_argptr.offset_1|, thread3Thread1of1ForFork0_~_argptr.offset=v_thread3Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork0_~_argptr.base]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[319] L57-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[301] L48-5-->L49: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[253] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[166] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[237] L82-->L82-1: Formula: (= |v_#pthreadsForks_10| |v_ULTIMATE.start_main_#t~pre16#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_10|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[171] L82-1-->L82-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks]" "[279] L82-2-->L82-3: Formula: (= |v_ULTIMATE.start_main_~t4~0#1_3| |v_ULTIMATE.start_main_#t~pre16#1_3|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} OutVars{ULTIMATE.start_main_~t4~0#1=|v_ULTIMATE.start_main_~t4~0#1_3|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t4~0#1]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[303] L49-->L49-1: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter1~0_5) 1 0)) InVars {~counter1~0=v_~counter1~0_5} OutVars{~counter1~0=v_~counter1~0_5, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[305] L49-1-->L32: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[307] L32-->L33: Formula: (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[309] L33-->L32-1: Formula: (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[311] L32-1-->L49-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1]" "[312] L49-2-->L50: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1]" "[358] L82-3-->$Ultimate##0: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4| 0) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre16#1_7| v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_6|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_4|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_14|, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_8|, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#in~_argptr#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#in~_argptr#1.offset, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_~_argptr#1.offset, thread4Thread1of1ForFork2_#res#1.offset]" "[330] $Ultimate##0-->L65: Formula: (and (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1| |v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|) (= |v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1| |v_thread4Thread1of1ForFork2_~_argptr#1.base_1|)) InVars {thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|} OutVars{thread4Thread1of1ForFork2_#in~_argptr#1.base=|v_thread4Thread1of1ForFork2_#in~_argptr#1.base_1|, thread4Thread1of1ForFork2_#in~_argptr#1.offset=|v_thread4Thread1of1ForFork2_#in~_argptr#1.offset_1|, thread4Thread1of1ForFork2_~_argptr#1.base=|v_thread4Thread1of1ForFork2_~_argptr#1.base_1|, thread4Thread1of1ForFork2_~_argptr#1.offset=|v_thread4Thread1of1ForFork2_~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~_argptr#1.base, thread4Thread1of1ForFork2_~_argptr#1.offset]" "[331] L65-->L65-5: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_1| 0) InVars {} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[313] L50-->L50-2: Formula: (and (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| v_~counter1~0_13) (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| (+ v_~counter1~0_12 1))) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~counter1~0]" "[314] L50-2-->L48-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1]" "[315] L48-2-->L48-3: Formula: (= |v_thread2Thread1of1ForFork3_#t~post4#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_9|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[316] L48-3-->L48-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_11| (+ |v_thread2Thread1of1ForFork3_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[317] L48-4-->L48-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1]" "[300] L48-5-->L48-6: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork3_~i~1#1_3|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[323] L58-->L58-2: Formula: (and (= |v_thread3Thread1of1ForFork0_#t~post5_1| v_~counter2~0_9) (= (+ |v_thread3Thread1of1ForFork0_#t~post5_1| 1) v_~counter2~0_8)) InVars {~counter2~0=v_~counter2~0_9} OutVars{~counter2~0=v_~counter2~0_8, thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post5]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[302] L48-6-->L53: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[304] L53-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base]" "[289] L40-5-->L41: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[291] L41-->L41-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~counter1~0_8) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~counter1~0_9)) InVars {~counter1~0=v_~counter1~0_9} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~counter1~0=v_~counter1~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~counter1~0]" "[293] L41-2-->L40-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[295] L40-2-->L40-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[296] L40-3-->L40-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[306] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[297] L40-4-->L40-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[288] L40-5-->L40-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[290] L40-6-->L44: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[292] L44-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[325] L58-2-->L57-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5]" "[327] L57-2-->L57-3: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 |v_thread3Thread1of1ForFork0_#t~post6_1|) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[328] L57-3-->L57-4: Formula: (= (+ |v_thread3Thread1of1ForFork0_#t~post6_3| 1) v_thread3Thread1of1ForFork0_~i~2_11) InVars {thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2]" "[329] L57-4-->L57-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6]" "[321] L57-5-->L58: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" "[294] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:30:09,539 INFO L754 eck$LassoCheckResult]: Loop: "[335] L66-->L66-1: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter2~0_5) 1 0)) InVars {~counter2~0=v_~counter2~0_5} OutVars{~counter2~0=v_~counter2~0_5, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[337] L66-1-->L32: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[339] L32-->L33: Formula: (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[341] L33-->L32-1: Formula: (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[343] L32-1-->L66-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1]" "[344] L66-2-->L67: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1]" "[345] L67-->L67-2: Formula: (and (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| (+ v_~counter2~0_12 1)) (= |v_thread4Thread1of1ForFork2_#t~post7#1_1| v_~counter2~0_13)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_#t~post7#1]" "[346] L67-2-->L65-2: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1]" "[347] L65-2-->L65-3: Formula: (= |v_thread4Thread1of1ForFork2_~i~3#1_9| |v_thread4Thread1of1ForFork2_#t~post8#1_1|) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_9|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[348] L65-3-->L65-4: Formula: (= (+ |v_thread4Thread1of1ForFork2_#t~post8#1_3| 1) |v_thread4Thread1of1ForFork2_~i~3#1_11|) InVars {thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_11|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_3|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1]" "[349] L65-4-->L65-5: Formula: true InVars {} OutVars{thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post8#1]" "[333] L65-5-->L66: Formula: (< |v_thread4Thread1of1ForFork2_~i~3#1_5| v_~N~0_9) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} OutVars{thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[]" [2025-04-26 18:30:09,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2034604567, now seen corresponding path program 2 times [2025-04-26 18:30:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:09,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125900571] [2025-04-26 18:30:09,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:30:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:09,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-04-26 18:30:09,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 160 statements. [2025-04-26 18:30:09,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:30:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:09,653 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:30:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:30:09,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125900571] [2025-04-26 18:30:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125900571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:30:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:30:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:30:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388020394] [2025-04-26 18:30:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:30:09,654 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:30:09,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 5 times [2025-04-26 18:30:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:30:09,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174546497] [2025-04-26 18:30:09,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:30:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:30:09,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:09,658 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:09,658 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:30:09,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:09,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:30:09,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:09,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:30:09,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:30:09,691 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:09,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:09,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:09,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:09,691 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:30:09,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:09,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:09,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration10_Loop [2025-04-26 18:30:09,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:09,691 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:09,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:09,797 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:09,798 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:30:09,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,802 INFO L229 MonitoredProcess]: Starting monitored process 170 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:30:09,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-04-26 18:30:09,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,822 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:09,822 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_19=3} Honda state: {v_rep#funAddr~thread4.offset_19=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:09,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-04-26 18:30:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,830 INFO L229 MonitoredProcess]: Starting monitored process 171 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:30:09,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-04-26 18:30:09,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,846 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:09,846 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Honda state: {thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:09,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,857 INFO L229 MonitoredProcess]: Starting monitored process 172 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:30:09,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-04-26 18:30:09,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,881 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:09,882 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_19=2} Honda state: {v_rep#funAddr~thread3.offset_19=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:09,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-04-26 18:30:09,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,890 INFO L229 MonitoredProcess]: Starting monitored process 173 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:30:09,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-04-26 18:30:09,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,912 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:09,912 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_19=-1} Honda state: {v_rep#funAddr~thread3.base_19=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:09,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-04-26 18:30:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,923 INFO L229 MonitoredProcess]: Starting monitored process 174 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:30:09,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-04-26 18:30:09,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,940 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:30:09,941 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_#t~post7#1=0} Honda state: {thread4Thread1of1ForFork2_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:30:09,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-04-26 18:30:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,948 INFO L229 MonitoredProcess]: Starting monitored process 175 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:30:09,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-04-26 18:30:09,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:30:09,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:09,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-04-26 18:30:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:09,971 INFO L229 MonitoredProcess]: Starting monitored process 176 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:30:09,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-04-26 18:30:09,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:30:09,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:30:10,060 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:30:10,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-04-26 18:30:10,064 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:30:10,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:30:10,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:30:10,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:30:10,064 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:30:10,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:30:10,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:30:10,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration10_Loop [2025-04-26 18:30:10,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:30:10,065 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:30:10,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:30:10,142 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:30:10,143 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:30:10,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:10,145 INFO L229 MonitoredProcess]: Starting monitored process 177 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:30:10,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-04-26 18:30:10,146 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:30:10,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:10,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:10,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:10,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:10,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:10,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:10,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:10,156 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:10,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-04-26 18:30:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:10,163 INFO L229 MonitoredProcess]: Starting monitored process 178 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:30:10,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-04-26 18:30:10,165 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:30:10,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:10,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:10,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:10,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:10,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:10,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:10,176 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:10,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-04-26 18:30:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:10,184 INFO L229 MonitoredProcess]: Starting monitored process 179 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:30:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-04-26 18:30:10,185 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:30:10,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:10,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:10,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:10,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:10,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:30:10,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:30:10,197 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:30:10,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-04-26 18:30:10,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:10,205 INFO L229 MonitoredProcess]: Starting monitored process 180 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:30:10,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-04-26 18:30:10,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:30:10,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:30:10,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:30:10,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:30:10,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:30:10,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:30:10,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:30:10,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:30:10,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:30:10,219 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:30:10,219 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:30:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:30:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:30:10,221 INFO L229 MonitoredProcess]: Starting monitored process 181 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:30:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-04-26 18:30:10,222 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:30:10,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-04-26 18:30:10,225 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:30:10,226 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:30:10,226 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread4Thread1of1ForFork2_~i~3#1) = 1*~N~0 - 1*thread4Thread1of1ForFork2_~i~3#1 Supporting invariants [] [2025-04-26 18:30:10,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-04-26 18:30:10,231 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:30:10,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:30:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-26 18:30:10,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-26 18:30:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:30:10,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:10,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:30:10,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:30:10,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:30:10,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:30:10,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:30:10,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:30:10,407 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:30:10,407 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:30:10,407 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19436 states and 27593 transitions. cyclomatic complexity: 8874 Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:30:10,553 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19436 states and 27593 transitions. cyclomatic complexity: 8874. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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 19491 states and 27657 transitions. Complement of second has 10 states. [2025-04-26 18:30:10,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 18:30:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (in total 104), 5 states have internal predecessors, (104), 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:30:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-26 18:30:10,554 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 160 letters. Loop has 12 letters. [2025-04-26 18:30:10,554 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:10,554 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 172 letters. Loop has 12 letters. [2025-04-26 18:30:10,554 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:10,554 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 160 letters. Loop has 24 letters. [2025-04-26 18:30:10,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:30:10,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19491 states and 27657 transitions. [2025-04-26 18:30:10,608 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:30:10,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19491 states to 0 states and 0 transitions. [2025-04-26 18:30:10,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:30:10,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:30:10,609 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:30:10,609 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:30:10,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:30:10,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:30:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:30:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:30:10,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:30:10,609 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (in total 106), 5 states have internal predecessors, (106), 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:30:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:30:10,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:30:10,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:30:10,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:30:10,610 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:30:10,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:30:10,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:30:10,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:30:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:30:10,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:30:10,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:30:10,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:30:10 BoogieIcfgContainer [2025-04-26 18:30:10,621 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:30:10,622 INFO L158 Benchmark]: Toolchain (without parser) took 72705.66ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 109.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-26 18:30:10,622 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:30:10,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 155.2MB. Free memory was 109.9MB in the beginning and 96.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:30:10,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.18ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 94.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:30:10,623 INFO L158 Benchmark]: Boogie Preprocessor took 17.18ms. Allocated memory is still 155.2MB. Free memory was 94.9MB in the beginning and 93.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:30:10,623 INFO L158 Benchmark]: RCFGBuilder took 232.31ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 78.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:30:10,623 INFO L158 Benchmark]: BuchiAutomizer took 72188.00ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 78.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-26 18:30:10,624 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 155.2MB. Free memory was 109.9MB in the beginning and 96.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.18ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 94.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.18ms. Allocated memory is still 155.2MB. Free memory was 94.9MB in the beginning and 93.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 232.31ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 78.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 72188.00ms. Allocated memory was 155.2MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 78.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 72.0s and 11 iterations. TraceHistogramMax:10. Analysis of lassos took 9.0s. Construction of modules took 1.8s. Büchi inclusion checks took 27.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 17.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 94839 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 17.1s Buchi closure took 0.3s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4935 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4921 mSDsluCounter, 13029 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9674 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3663 IncrementalHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 3355 mSDtfsCounter, 3663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT5 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax431 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 62 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.1s InitialAbstractionConstructionTime: 7.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 7242, Number of transitions in reduction automaton: 57840, Number of states in reduction automaton: 41008, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (8 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + N) and consists of 6 locations. One deterministic module has affine ranking function counter1 and consists of 9 locations. One deterministic module has affine ranking function counter1 and consists of 8 locations. One deterministic module has affine ranking function (((long long) -1 * i) + N) and consists of 5 locations. One deterministic module has affine ranking function counter2 and consists of 8 locations. One deterministic module has affine ranking function counter2 and consists of 8 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 6 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 19 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:30:10,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:10,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:11,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2025-04-26 18:30:11,237 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...