/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 16:41:21,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:41:21,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:41:21,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:41:21,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:41:21,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:41:21,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:41:21,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:41:21,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:41:21,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:41:21,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:41:21,547 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:41:21,547 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:41:21,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:41:21,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:41:21,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:41:21,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:41:21,549 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:41:21,550 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:41:21,550 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:41:21,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:41:21,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:41:21,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:41:21,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:41:21,772 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:41:21,772 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 16:41:23,080 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f4f801d01/469e56e6152e4c4eb89570b3c46bf12f/FLAGa3f39639a [2025-04-26 16:41:23,277 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:41:23,282 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2025-04-26 16:41:23,294 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f4f801d01/469e56e6152e4c4eb89570b3c46bf12f/FLAGa3f39639a [2025-04-26 16:41:24,081 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f4f801d01/469e56e6152e4c4eb89570b3c46bf12f [2025-04-26 16:41:24,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:41:24,084 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:41:24,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:41:24,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:41:24,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:41:24,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec3b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24, skipping insertion in model container [2025-04-26 16:41:24,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:41:24,265 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 16:41:24,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:41:24,277 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:41:24,306 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 16:41:24,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:41:24,319 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:41:24,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24 WrapperNode [2025-04-26 16:41:24,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:41:24,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:41:24,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:41:24,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:41:24,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,351 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2025-04-26 16:41:24,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:41:24,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:41:24,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:41:24,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:41:24,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:41:24,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:41:24,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:41:24,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:41:24,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (1/1) ... [2025-04-26 16:41:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:41:24,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:24,406 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 16:41:24,412 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 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:41:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:41:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:41:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:41:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:41:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:41:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:41:24,428 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:41:24,499 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:41:24,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:41:24,655 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:41:24,655 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:41:24,674 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:41:24,674 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:41:24,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:41:24 BoogieIcfgContainer [2025-04-26 16:41:24,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:41:24,675 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:41:24,675 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:41:24,679 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:41:24,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:41:24,679 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:41:24" (1/3) ... [2025-04-26 16:41:24,680 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d363855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:41:24, skipping insertion in model container [2025-04-26 16:41:24,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:41:24,680 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:41:24" (2/3) ... [2025-04-26 16:41:24,680 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d363855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:41:24, skipping insertion in model container [2025-04-26 16:41:24,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:41:24,681 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:41:24" (3/3) ... [2025-04-26 16:41:24,682 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-04-26 16:41:24,752 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:41:24,786 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:41:24,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:41:24,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:24,790 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 16:41:24,792 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 16:41:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 292 flow [2025-04-26 16:41:24,895 INFO L116 PetriNetUnfolderBase]: 7/124 cut-off events. [2025-04-26 16:41:24,897 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:41:24,903 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 16:41:24,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 292 flow [2025-04-26 16:41:24,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 124 transitions, 272 flow [2025-04-26 16:41:24,910 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 130 places, 124 transitions, 272 flow [2025-04-26 16:41:24,915 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:41:28,388 WARN L140 AmpleReduction]: Number of pruned transitions: 117144 [2025-04-26 16:41:28,388 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:41:28,388 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3550 [2025-04-26 16:41:28,388 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:125 [2025-04-26 16:41:28,389 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:37337 [2025-04-26 16:41:28,389 WARN L145 AmpleReduction]: Times succ was already a loop node:597 [2025-04-26 16:41:28,389 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8149 [2025-04-26 16:41:28,389 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:41:28,462 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 41013 states, 41011 states have (on average 1.4105240057545536) internal successors, (in total 57847), 41012 states have internal predecessors, (57847), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:28,469 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:41:28,469 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:41:28,469 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:41:28,469 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:41:28,469 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:41:28,469 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:41:28,469 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:41:28,469 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:41:28,510 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41013 states, 41011 states have (on average 1.4105240057545536) internal successors, (in total 57847), 41012 states have internal predecessors, (57847), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:29,008 INFO L131 ngComponentsAnalysis]: Automaton has 1093 accepting balls. 32161 [2025-04-26 16:41:29,008 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:29,009 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:29,016 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 16:41:29,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:41:29,016 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:41:29,055 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41013 states, 41011 states have (on average 1.4105240057545536) internal successors, (in total 57847), 41012 states have internal predecessors, (57847), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:29,420 INFO L131 ngComponentsAnalysis]: Automaton has 1093 accepting balls. 32161 [2025-04-26 16:41:29,421 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:29,421 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:29,422 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 16:41:29,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:41:29,428 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 16:41:29,429 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 16:41:29,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1249963208, now seen corresponding path program 1 times [2025-04-26 16:41:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:29,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813405650] [2025-04-26 16:41:29,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:29,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:41:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:41:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:41:29,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:41:29,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:29,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 849160070, now seen corresponding path program 1 times [2025-04-26 16:41:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:29,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715210806] [2025-04-26 16:41:29,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:29,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:29,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:29,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:29,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:29,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:29,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash -88792307, now seen corresponding path program 1 times [2025-04-26 16:41:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:29,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078133606] [2025-04-26 16:41:29,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:41:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:41:29,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:41:29,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:41:29,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:29,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:29,660 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:29,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:29,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:29,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:29,661 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:29,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:29,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:29,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:41:29,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:29,661 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:29,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:29,812 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:29,813 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:41:29,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,842 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,842 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 16:41:29,849 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 16:41:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:41:29,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,876 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,876 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 16:41:29,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:41:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:41:29,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,907 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,907 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 16:41:29,913 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 16:41:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:41:29,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,936 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,937 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 16:41:29,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:41:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:41:29,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,966 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,967 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 16:41:29,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:41:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:29,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:41:29,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:29,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:29,993 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:29,993 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 16:41:29,998 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 16:41:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:29,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:41:30,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:30,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,020 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:30,020 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 16:41:30,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:41:30,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:41:30,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:30,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,045 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 16:41:30,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:41:30,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:30,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,073 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:30,073 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 16:41:30,078 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 16:41:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,080 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:41:30,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:30,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,100 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:30,100 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 16:41:30,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,107 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:41:30,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:30,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,119 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:30,119 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 16:41:30,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:41:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:41:30,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:30,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:41:30,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,149 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:41:30,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:30,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:30,215 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:30,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,220 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:30,220 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:30,220 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:30,220 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:30,220 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:30,220 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,220 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:30,220 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:30,220 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:41:30,220 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:30,220 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:30,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:30,347 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:30,350 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:30,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:41:30,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:41:30,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,381 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:41:30,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,404 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 16:41:30,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,407 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:41:30,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:41:30,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,432 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:41:30,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,452 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:41:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,459 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:41:30,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,491 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:41:30,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:41:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,518 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:41:30,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:30,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:30,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:30,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,540 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 16:41:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,543 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:41:30,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,570 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:41:30,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:30,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:30,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,598 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:41:30,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:30,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:30,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:30,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:30,620 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 16:41:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,623 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:41:30,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:30,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:30,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:30,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:30,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:30,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:30,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:30,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:30,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:30,653 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:41:30,654 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:41:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:30,662 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:30,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:41:30,665 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:30,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:30,668 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:30,669 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:30,669 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 16:41:30,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:41:30,678 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:30,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:30,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:41:30,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:41:30,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:30,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:30,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:30,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:30,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:41:30,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:30,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:41:30,907 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 41013 states, 41011 states have (on average 1.4105240057545536) internal successors, (in total 57847), 41012 states have internal predecessors, (57847), 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 16:41:32,019 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 41013 states, 41011 states have (on average 1.4105240057545536) internal successors, (in total 57847), 41012 states have internal predecessors, (57847), 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 98814 states and 140836 transitions. Complement of second has 10 states. [2025-04-26 16:41:32,020 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 16:41:32,023 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 16:41:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2025-04-26 16:41:32,027 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 24 letters. Loop has 6 letters. [2025-04-26 16:41:32,028 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:32,028 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 30 letters. Loop has 6 letters. [2025-04-26 16:41:32,028 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:32,028 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 24 letters. Loop has 12 letters. [2025-04-26 16:41:32,028 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:32,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98814 states and 140836 transitions. [2025-04-26 16:41:32,707 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 17964 [2025-04-26 16:41:32,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98814 states to 43684 states and 61893 transitions. [2025-04-26 16:41:32,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27016 [2025-04-26 16:41:33,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29461 [2025-04-26 16:41:33,011 INFO L74 IsDeterministic]: Start isDeterministic. Operand 43684 states and 61893 transitions. [2025-04-26 16:41:33,012 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:33,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43684 states and 61893 transitions. [2025-04-26 16:41:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43684 states and 61893 transitions. [2025-04-26 16:41:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43684 to 42927. [2025-04-26 16:41:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42927 states, 42927 states have (on average 1.422065366785473) internal successors, (in total 61045), 42926 states have internal predecessors, (61045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42927 states to 42927 states and 61045 transitions. [2025-04-26 16:41:33,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42927 states and 61045 transitions. [2025-04-26 16:41:33,956 INFO L438 stractBuchiCegarLoop]: Abstraction has 42927 states and 61045 transitions. [2025-04-26 16:41:33,956 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:41:33,956 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42927 states and 61045 transitions. [2025-04-26 16:41:34,079 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 17964 [2025-04-26 16:41:34,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:34,079 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:34,080 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 16:41:34,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:41:34,083 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 16:41:34,084 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 16:41:34,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2082927457, now seen corresponding path program 1 times [2025-04-26 16:41:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:34,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429759804] [2025-04-26 16:41:34,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:34,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:41:34,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:41:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:34,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:34,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:41:34,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:41:34,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:34,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:34,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -615099414, now seen corresponding path program 1 times [2025-04-26 16:41:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:34,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490804666] [2025-04-26 16:41:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:34,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:34,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:34,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:34,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:34,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:34,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:34,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:34,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:34,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:34,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:34,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 516634442, now seen corresponding path program 1 times [2025-04-26 16:41:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:34,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560128918] [2025-04-26 16:41:34,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 16:41:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 16:41:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:34,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:41:34,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560128918] [2025-04-26 16:41:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560128918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:41:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:41:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:41:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292290272] [2025-04-26 16:41:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:41:34,375 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:34,376 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:34,376 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:34,376 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:34,376 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:34,376 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,376 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:34,376 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:34,376 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:41:34,376 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:34,376 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:34,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,511 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:34,511 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:34,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,514 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:41:34,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,534 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,534 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 16:41:34,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:41:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,542 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:41:34,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,561 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,561 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 16:41:34,566 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 16:41:34,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,567 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:41:34,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,585 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,585 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 16:41:34,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:41:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,592 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:41:34,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,611 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,611 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 16:41:34,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:41:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,617 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:41:34,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,630 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,630 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 16:41:34,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:41:34,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,637 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:41:34,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,655 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,655 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 16:41:34,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:41:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,662 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:41:34,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,679 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,679 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 16:41:34,684 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 16:41:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,686 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:41:34,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,703 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,704 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 16:41:34,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:41:34,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,710 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:41:34,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,722 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,722 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 16:41:34,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:34,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,728 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:41:34,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,747 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,747 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 16:41:34,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:41:34,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,754 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:41:34,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,773 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,773 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 16:41:34,780 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 16:41:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,782 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:41:34,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,796 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:34,796 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 16:41:34,802 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 16:41:34,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,804 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:41:34,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:34,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,822 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:41:34,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:34,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:34,843 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:34,849 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 16:41:34,850 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:34,850 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:34,850 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:34,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:34,850 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:34,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:34,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:34,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:41:34,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:34,850 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:34,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:34,959 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:34,960 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:34,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,961 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:41:34,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:34,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:34,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:34,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:34,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:34,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:34,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:34,978 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:34,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:34,986 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:41:34,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:34,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:35,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:35,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:35,001 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:35,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,009 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:41:35,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,206 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:41:35,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,224 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:41:35,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,235 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:41:35,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,251 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,256 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 16:41:35,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,258 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:41:35,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:35,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:35,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:35,271 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,276 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 16:41:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,278 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:41:35,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,296 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:41:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,303 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:41:35,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,317 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:41:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,324 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:41:35,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,337 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:35,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,348 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:41:35,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:35,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:35,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:35,362 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:35,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,370 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:41:35,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:35,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:35,384 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:35,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:41:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,391 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:41:35,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:35,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:35,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:35,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:35,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:35,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:35,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:35,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:35,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:35,406 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:41:35,406 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:41:35,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:35,408 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:35,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:41:35,409 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:35,412 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 16:41:35,412 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:35,412 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:35,412 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter1~0) = 1*~counter1~0 Supporting invariants [] [2025-04-26 16:41:35,416 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 16:41:35,417 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:35,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:35,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:41:35,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:41:35,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:35,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:35,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:35,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:35,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:35,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:35,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:41:35,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:35,593 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 16:41:35,593 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42927 states and 61045 transitions. cyclomatic complexity: 19064 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 16:41:36,059 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42927 states and 61045 transitions. cyclomatic complexity: 19064. 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 77274 states and 105009 transitions. Complement of second has 16 states. [2025-04-26 16:41:36,059 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 16:41:36,060 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 16:41:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-04-26 16:41:36,060 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 379 transitions. Stem has 33 letters. Loop has 12 letters. [2025-04-26 16:41:36,060 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:36,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 379 transitions. Stem has 45 letters. Loop has 12 letters. [2025-04-26 16:41:36,061 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:36,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 379 transitions. Stem has 33 letters. Loop has 24 letters. [2025-04-26 16:41:36,061 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:36,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77274 states and 105009 transitions. [2025-04-26 16:41:36,363 INFO L131 ngComponentsAnalysis]: Automaton has 557 accepting balls. 18533 [2025-04-26 16:41:36,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77274 states to 55890 states and 77230 transitions. [2025-04-26 16:41:36,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33172 [2025-04-26 16:41:36,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33895 [2025-04-26 16:41:36,623 INFO L74 IsDeterministic]: Start isDeterministic. Operand 55890 states and 77230 transitions. [2025-04-26 16:41:36,624 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:36,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55890 states and 77230 transitions. [2025-04-26 16:41:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55890 states and 77230 transitions. [2025-04-26 16:41:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55890 to 55220. [2025-04-26 16:41:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55220 states, 55220 states have (on average 1.3842991669684896) internal successors, (in total 76441), 55219 states have internal predecessors, (76441), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55220 states to 55220 states and 76441 transitions. [2025-04-26 16:41:37,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55220 states and 76441 transitions. [2025-04-26 16:41:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:41:37,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:41:37,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:41:37,880 INFO L87 Difference]: Start difference. First operand 55220 states and 76441 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 16:41:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:41:38,195 INFO L93 Difference]: Finished difference Result 55683 states and 75645 transitions. [2025-04-26 16:41:38,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55683 states and 75645 transitions. [2025-04-26 16:41:38,469 INFO L131 ngComponentsAnalysis]: Automaton has 561 accepting balls. 17335 [2025-04-26 16:41:38,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55683 states to 54320 states and 74282 transitions. [2025-04-26 16:41:38,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32315 [2025-04-26 16:41:38,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32315 [2025-04-26 16:41:38,883 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54320 states and 74282 transitions. [2025-04-26 16:41:38,883 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:38,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54320 states and 74282 transitions. [2025-04-26 16:41:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54320 states and 74282 transitions. [2025-04-26 16:41:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54320 to 52006. [2025-04-26 16:41:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52006 states, 52006 states have (on average 1.379648502095912) internal successors, (in total 71750), 52005 states have internal predecessors, (71750), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52006 states to 52006 states and 71750 transitions. [2025-04-26 16:41:39,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52006 states and 71750 transitions. [2025-04-26 16:41:39,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:41:39,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 52006 states and 71750 transitions. [2025-04-26 16:41:39,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:41:39,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52006 states and 71750 transitions. [2025-04-26 16:41:39,765 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 16623 [2025-04-26 16:41:39,765 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:39,765 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:39,766 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 16:41:39,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:41:39,767 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 16:41:39,767 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 16:41:39,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -84602361, now seen corresponding path program 1 times [2025-04-26 16:41:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:39,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51473340] [2025-04-26 16:41:39,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:39,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:41:39,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:41:39,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:39,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:39,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:41:39,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:41:39,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:39,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:39,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 738902456, now seen corresponding path program 2 times [2025-04-26 16:41:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:39,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248992013] [2025-04-26 16:41:39,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:41:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:39,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:39,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:39,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:41:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:39,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:39,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:39,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:39,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:39,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash 755432126, now seen corresponding path program 1 times [2025-04-26 16:41:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:39,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524315957] [2025-04-26 16:41:39,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:39,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 16:41:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 16:41:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:39,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-26 16:41:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-26 16:41:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:39,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:39,834 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:39,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:39,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:39,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:39,834 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:39,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:39,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:39,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:39,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration3_Loop [2025-04-26 16:41:39,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:39,834 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:39,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:39,934 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:39,934 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:39,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:39,937 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:39,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:41:39,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:39,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:39,958 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:39,958 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 16:41:39,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:41:39,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:39,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:39,967 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:39,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:41:39,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:39,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:39,988 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:39,988 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 16:41:39,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:39,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:39,996 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:39,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:41:39,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:39,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:40,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:41:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,022 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:41:40,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:40,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:40,106 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:40,111 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 16:41:40,111 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:40,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:40,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:40,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:40,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:40,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:40,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:40,111 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration3_Loop [2025-04-26 16:41:40,111 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:40,111 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:40,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:40,218 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:40,218 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,222 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:41:40,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:40,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:40,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:40,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:40,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:40,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:40,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:40,239 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:40,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:40,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,246 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:41:40,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:40,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:40,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:40,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:40,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:40,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:40,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:40,263 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:40,269 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 16:41:40,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,271 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:41:40,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:40,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:40,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:40,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:40,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:40,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:40,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:40,289 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:40,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:40,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,297 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:41:40,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:40,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:40,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:40,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:40,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:40,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:40,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:40,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:40,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:40,315 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:41:40,315 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:41:40,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:40,317 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:40,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:41:40,319 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:40,322 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:41:40,322 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 16:41:40,323 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:40,323 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:40,323 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 16:41:40,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:40,330 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:40,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:40,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:41:40,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:41:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:40,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:40,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:40,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:40,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:40,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:40,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:41:40,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:40,429 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 16:41:40,429 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813 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 16:41:40,788 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813. 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 52507 states and 72353 transitions. Complement of second has 5 states. [2025-04-26 16:41:40,789 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 16:41:40,789 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 16:41:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-26 16:41:40,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 105 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 16:41:40,790 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:40,790 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:41:40,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:40,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:41:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:41:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:40,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:40,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:40,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:40,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:40,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:41:40,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:40,897 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 16:41:40,897 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813 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 16:41:41,095 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813. 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 52507 states and 72353 transitions. Complement of second has 5 states. [2025-04-26 16:41:41,096 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 16:41:41,096 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 16:41:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-26 16:41:41,096 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 105 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 16:41:41,097 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:41,097 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:41:41,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:41,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:41:41,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:41:41,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:41,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:41,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:41,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:41,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:41,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:41,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:41,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:41:41,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:41,196 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 16:41:41,196 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813 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 16:41:41,953 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52006 states and 71750 transitions. cyclomatic complexity: 20813. 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 135674 states and 185021 transitions. Complement of second has 20 states. [2025-04-26 16:41:41,953 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 16:41:41,954 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 16:41:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-04-26 16:41:41,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 367 transitions. Stem has 40 letters. Loop has 12 letters. [2025-04-26 16:41:41,954 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:41,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 367 transitions. Stem has 52 letters. Loop has 12 letters. [2025-04-26 16:41:41,954 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:41,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 367 transitions. Stem has 40 letters. Loop has 24 letters. [2025-04-26 16:41:41,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:41,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135674 states and 185021 transitions. [2025-04-26 16:41:42,909 INFO L131 ngComponentsAnalysis]: Automaton has 591 accepting balls. 17003 [2025-04-26 16:41:43,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135674 states to 95792 states and 129437 transitions. [2025-04-26 16:41:43,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49122 [2025-04-26 16:41:43,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50571 [2025-04-26 16:41:43,308 INFO L74 IsDeterministic]: Start isDeterministic. Operand 95792 states and 129437 transitions. [2025-04-26 16:41:43,308 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:43,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95792 states and 129437 transitions. [2025-04-26 16:41:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95792 states and 129437 transitions. [2025-04-26 16:41:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95792 to 78124. [2025-04-26 16:41:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78124 states, 78124 states have (on average 1.3563693615278276) internal successors, (in total 105965), 78123 states have internal predecessors, (105965), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78124 states to 78124 states and 105965 transitions. [2025-04-26 16:41:44,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78124 states and 105965 transitions. [2025-04-26 16:41:44,569 INFO L438 stractBuchiCegarLoop]: Abstraction has 78124 states and 105965 transitions. [2025-04-26 16:41:44,569 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:41:44,569 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78124 states and 105965 transitions. [2025-04-26 16:41:44,799 INFO L131 ngComponentsAnalysis]: Automaton has 482 accepting balls. 16110 [2025-04-26 16:41:44,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:44,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:44,800 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 16:41:44,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:41:44,803 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 16:41:44,803 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 16:41:44,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash 301518024, now seen corresponding path program 1 times [2025-04-26 16:41:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:44,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628139424] [2025-04-26 16:41:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:41:44,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:41:44,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:44,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:44,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:44,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:41:44,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:41:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:44,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:44,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 738902456, now seen corresponding path program 3 times [2025-04-26 16:41:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:44,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157534024] [2025-04-26 16:41:44,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:41:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:44,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:44,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:44,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:41:44,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:44,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:44,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:44,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:44,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:44,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:44,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -619996161, now seen corresponding path program 1 times [2025-04-26 16:41:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:44,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594127411] [2025-04-26 16:41:44,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:44,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 16:41:44,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 16:41:44,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:44,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:44,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:41:44,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594127411] [2025-04-26 16:41:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594127411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:41:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:41:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 16:41:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921453940] [2025-04-26 16:41:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:41:45,144 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:45,144 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:45,144 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:45,144 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:45,144 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:45,144 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,144 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:45,144 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:45,144 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration4_Loop [2025-04-26 16:41:45,144 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:45,144 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:45,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,247 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:45,247 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,251 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:41:45,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:45,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,270 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:45,270 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 16:41:45,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:41:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,277 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:41:45,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:45,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,297 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:45,297 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 16:41:45,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:45,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,304 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:41:45,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:45,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,323 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:45,323 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 16:41:45,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:41:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,330 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:41:45,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:45,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,348 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:45,348 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 16:41:45,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:45,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,356 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:41:45,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:45,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:41:45,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,375 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:41:45,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:45,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:45,398 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:45,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:41:45,402 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:45,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:45,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:45,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:45,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:45,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:45,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:45,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration4_Loop [2025-04-26 16:41:45,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:45,402 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:45,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:45,506 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:45,506 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:45,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,508 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:41:45,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,523 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:41:45,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,531 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:41:45,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,549 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:45,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,557 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:41:45,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,574 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,582 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:41:45,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,599 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:41:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,607 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:41:45,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:45,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:45,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:45,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,627 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 16:41:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,629 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:41:45,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:41:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,655 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:41:45,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:45,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:45,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:45,681 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 16:41:45,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,684 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:41:45,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:45,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:45,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:45,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:45,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:45,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:45,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:45,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:45,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:45,700 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:41:45,700 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:41:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:45,702 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:45,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:41:45,704 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:45,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:41:45,707 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:45,707 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:45,707 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter1~0) = 1*~counter1~0 Supporting invariants [] [2025-04-26 16:41:45,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:41:45,713 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:45,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:41:45,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:41:45,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:45,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:45,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:45,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:41:45,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:45,895 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 16:41:45,895 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78124 states and 105965 transitions. cyclomatic complexity: 29226 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 16:41:46,764 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78124 states and 105965 transitions. cyclomatic complexity: 29226. 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 135110 states and 182301 transitions. Complement of second has 14 states. [2025-04-26 16:41:46,764 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 16:41:46,765 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 16:41:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2025-04-26 16:41:46,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 42 letters. Loop has 12 letters. [2025-04-26 16:41:46,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:46,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 54 letters. Loop has 12 letters. [2025-04-26 16:41:46,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:46,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 404 transitions. Stem has 42 letters. Loop has 24 letters. [2025-04-26 16:41:46,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:46,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135110 states and 182301 transitions. [2025-04-26 16:41:47,650 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 16:41:48,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135110 states to 87618 states and 117364 transitions. [2025-04-26 16:41:48,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23212 [2025-04-26 16:41:48,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34731 [2025-04-26 16:41:48,046 INFO L74 IsDeterministic]: Start isDeterministic. Operand 87618 states and 117364 transitions. [2025-04-26 16:41:48,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:48,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87618 states and 117364 transitions. [2025-04-26 16:41:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87618 states and 117364 transitions. [2025-04-26 16:41:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87618 to 69256. [2025-04-26 16:41:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69256 states, 69256 states have (on average 1.3664375649763199) internal successors, (in total 94634), 69255 states have internal predecessors, (94634), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69256 states to 69256 states and 94634 transitions. [2025-04-26 16:41:49,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69256 states and 94634 transitions. [2025-04-26 16:41:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:41:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 16:41:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-26 16:41:49,245 INFO L87 Difference]: Start difference. First operand 69256 states and 94634 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 16:41:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:41:49,896 INFO L93 Difference]: Finished difference Result 74594 states and 102788 transitions. [2025-04-26 16:41:49,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74594 states and 102788 transitions. [2025-04-26 16:41:50,478 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 16:41:50,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74594 states to 74577 states and 102769 transitions. [2025-04-26 16:41:50,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26794 [2025-04-26 16:41:50,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26808 [2025-04-26 16:41:50,798 INFO L74 IsDeterministic]: Start isDeterministic. Operand 74577 states and 102769 transitions. [2025-04-26 16:41:50,798 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:50,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74577 states and 102769 transitions. [2025-04-26 16:41:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74577 states and 102769 transitions. [2025-04-26 16:41:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74577 to 69260. [2025-04-26 16:41:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69260 states, 69260 states have (on average 1.3664308403118683) internal successors, (in total 94639), 69259 states have internal predecessors, (94639), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69260 states to 69260 states and 94639 transitions. [2025-04-26 16:41:51,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69260 states and 94639 transitions. [2025-04-26 16:41:51,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:41:51,896 INFO L438 stractBuchiCegarLoop]: Abstraction has 69260 states and 94639 transitions. [2025-04-26 16:41:51,896 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:41:51,896 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69260 states and 94639 transitions. [2025-04-26 16:41:52,055 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 1187 [2025-04-26 16:41:52,055 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:52,056 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:52,056 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 16:41:52,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:41:52,057 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 16:41:52,057 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 16:41:52,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1483138082, now seen corresponding path program 1 times [2025-04-26 16:41:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:52,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537613941] [2025-04-26 16:41:52,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:52,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:41:52,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:41:52,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:52,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:41:52,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:41:52,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:52,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:52,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:52,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1795830662, now seen corresponding path program 1 times [2025-04-26 16:41:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:52,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546011178] [2025-04-26 16:41:52,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:52,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:52,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:52,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:52,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:52,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:52,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:52,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:52,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1029946087, now seen corresponding path program 1 times [2025-04-26 16:41:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:52,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103855769] [2025-04-26 16:41:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 16:41:52,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 16:41:52,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:52,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:41:52,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103855769] [2025-04-26 16:41:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103855769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:41:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:41:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:41:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311970325] [2025-04-26 16:41:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:41:52,144 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:52,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:52,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:52,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:52,145 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:52,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:52,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:52,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration5_Loop [2025-04-26 16:41:52,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:52,145 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:52,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,215 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:52,215 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:52,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,217 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:41:52,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,237 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,237 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 16:41:52,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:41:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,244 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:41:52,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,262 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,262 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 16:41:52,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:41:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,269 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:41:52,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,287 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,287 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 16:41:52,292 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 16:41:52,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,294 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:41:52,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,312 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,312 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 16:41:52,317 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 16:41:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,319 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:41:52,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,338 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,338 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 16:41:52,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,345 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:41:52,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,362 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,363 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 16:41:52,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:41:52,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,369 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:41:52,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,526 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:41:52,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:52,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,551 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,551 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 16:41:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:52,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,558 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:41:52,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,576 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,577 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 16:41:52,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:41:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,583 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:41:52,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,595 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,595 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 16:41:52,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 16:41:52,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,603 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:41:52,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,615 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,615 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 16:41:52,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:41:52,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,622 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:41:52,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,641 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:52,641 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 16:41:52,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:41:52,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,648 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:41:52,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:52,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,665 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 16:41:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,667 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:41:52,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:52,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:52,731 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:52,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:41:52,735 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:52,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:52,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:52,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:52,735 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:52,735 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,735 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:52,735 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:52,735 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration5_Loop [2025-04-26 16:41:52,735 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:52,735 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:52,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:52,821 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:52,821 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:52,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,825 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:41:52,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:52,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,849 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:41:52,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:41:52,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,865 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,873 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 16:41:52,874 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 16:41:52,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,891 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,897 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 16:41:52,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,899 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 16:41:52,900 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 16:41:52,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:52,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:52,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:52,912 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,917 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 16:41:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,919 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 16:41:52,919 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 16:41:52,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,933 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,938 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 16:41:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,940 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 16:41:52,941 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 16:41:52,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 16:41:52,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,959 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 16:41:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,962 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 16:41:52,962 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 16:41:52,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:52,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:52,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:52,974 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:52,978 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 16:41:52,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:52,980 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 16:41:52,981 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 16:41:52,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:52,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:52,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:52,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:52,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:52,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:52,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:52,995 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:53,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:53,002 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 16:41:53,002 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 16:41:53,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:53,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:53,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:53,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:53,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:53,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:53,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:53,016 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:53,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-04-26 16:41:53,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:53,023 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 16:41:53,023 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 16:41:53,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:53,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:53,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:53,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:53,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:53,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:53,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:53,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:53,037 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:53,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:53,043 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 16:41:53,044 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 16:41:53,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:53,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:53,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:53,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:53,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:53,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:53,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:53,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:53,062 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 16:41:53,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:53,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:53,064 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 16:41:53,064 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 16:41:53,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:53,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:53,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:53,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:53,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:53,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:53,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:53,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:53,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:53,078 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:41:53,078 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:41:53,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:53,080 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 16:41:53,081 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 16:41:53,082 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:53,085 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 16:41:53,085 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:53,085 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:53,085 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 16:41:53,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-04-26 16:41:53,090 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:53,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:53,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:41:53,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:41:53,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:53,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:53,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:53,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:53,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:41:53,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:41:53,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:53,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:53,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:41:53,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:53,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:41:53,179 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69260 states and 94639 transitions. cyclomatic complexity: 26530 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 16:41:53,835 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69260 states and 94639 transitions. cyclomatic complexity: 26530. 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 128916 states and 176362 transitions. Complement of second has 9 states. [2025-04-26 16:41:53,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:41:53,836 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 16:41:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2025-04-26 16:41:53,837 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 48 letters. Loop has 6 letters. [2025-04-26 16:41:53,837 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:53,837 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 54 letters. Loop has 6 letters. [2025-04-26 16:41:53,837 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:53,837 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 294 transitions. Stem has 48 letters. Loop has 12 letters. [2025-04-26 16:41:53,837 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:41:53,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128916 states and 176362 transitions. [2025-04-26 16:41:54,675 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:41:55,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128916 states to 81833 states and 111679 transitions. [2025-04-26 16:41:55,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17576 [2025-04-26 16:41:55,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18266 [2025-04-26 16:41:55,031 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81833 states and 111679 transitions. [2025-04-26 16:41:55,031 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:55,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81833 states and 111679 transitions. [2025-04-26 16:41:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81833 states and 111679 transitions. [2025-04-26 16:41:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81833 to 81135. [2025-04-26 16:41:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81135 states, 81135 states have (on average 1.3656868182658533) internal successors, (in total 110805), 81134 states have internal predecessors, (110805), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81135 states to 81135 states and 110805 transitions. [2025-04-26 16:41:56,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81135 states and 110805 transitions. [2025-04-26 16:41:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:41:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:41:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:41:56,299 INFO L87 Difference]: Start difference. First operand 81135 states and 110805 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 16:41:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:41:56,623 INFO L93 Difference]: Finished difference Result 81261 states and 110936 transitions. [2025-04-26 16:41:56,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81261 states and 110936 transitions. [2025-04-26 16:41:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 624 [2025-04-26 16:41:57,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81261 states to 81261 states and 110936 transitions. [2025-04-26 16:41:57,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17754 [2025-04-26 16:41:57,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17754 [2025-04-26 16:41:57,557 INFO L74 IsDeterministic]: Start isDeterministic. Operand 81261 states and 110936 transitions. [2025-04-26 16:41:57,558 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:41:57,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81261 states and 110936 transitions. [2025-04-26 16:41:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81261 states and 110936 transitions. [2025-04-26 16:41:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81261 to 81156. [2025-04-26 16:41:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81156 states, 81156 states have (on average 1.36559219281384) internal successors, (in total 110826), 81155 states have internal predecessors, (110826), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:41:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81156 states to 81156 states and 110826 transitions. [2025-04-26 16:41:58,611 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81156 states and 110826 transitions. [2025-04-26 16:41:58,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:41:58,612 INFO L438 stractBuchiCegarLoop]: Abstraction has 81156 states and 110826 transitions. [2025-04-26 16:41:58,612 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:41:58,612 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81156 states and 110826 transitions. [2025-04-26 16:41:59,027 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:41:59,028 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:41:59,028 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:41:59,028 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 16:41:59,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:41:59,029 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 16:41:59,029 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 16:41:59,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -980020035, now seen corresponding path program 1 times [2025-04-26 16:41:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:59,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672781855] [2025-04-26 16:41:59,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:59,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 16:41:59,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 16:41:59,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:59,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:59,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 16:41:59,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 16:41:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:59,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:59,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1362586602, now seen corresponding path program 1 times [2025-04-26 16:41:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:59,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095358023] [2025-04-26 16:41:59,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:59,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:59,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:59,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:59,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:41:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:59,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:41:59,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:41:59,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash -897038682, now seen corresponding path program 1 times [2025-04-26 16:41:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:41:59,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326981367] [2025-04-26 16:41:59,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:41:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:41:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-26 16:41:59,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-26 16:41:59,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:59,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 16:41:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:41:59,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326981367] [2025-04-26 16:41:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326981367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:41:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:41:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:41:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328461966] [2025-04-26 16:41:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:41:59,182 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:59,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:59,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:59,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:59,182 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:41:59,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:59,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:59,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration6_Loop [2025-04-26 16:41:59,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:59,183 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:59,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,278 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:59,279 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:41:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,281 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 16:41:59,282 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 16:41:59,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:59,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:59,295 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:41:59,295 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 16:41:59,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:59,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,303 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 16:41:59,304 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 16:41:59,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:41:59,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:59,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-04-26 16:41:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,324 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 16:41:59,325 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 16:41:59,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:41:59,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:41:59,346 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:41:59,349 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 16:41:59,350 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:41:59,350 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:41:59,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:41:59,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:41:59,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:41:59,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:41:59,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:41:59,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration6_Loop [2025-04-26 16:41:59,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:41:59,350 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:41:59,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:41:59,427 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:41:59,427 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:41:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,429 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 16:41:59,430 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 16:41:59,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:59,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:59,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:59,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:59,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:59,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:59,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:59,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:59,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:59,447 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 16:41:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,449 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 16:41:59,450 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 16:41:59,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:59,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:59,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:59,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:59,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:59,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:59,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:59,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:59,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:59,466 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 16:41:59,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,469 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 16:41:59,470 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 16:41:59,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:59,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:59,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:59,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:59,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:59,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:59,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:59,487 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:59,492 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 16:41:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,494 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 16:41:59,495 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 16:41:59,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:59,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:59,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:59,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:59,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:59,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:41:59,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:41:59,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:41:59,513 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 16:41:59,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,515 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 16:41:59,515 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 16:41:59,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:41:59,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:41:59,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:41:59,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:41:59,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:41:59,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:41:59,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:41:59,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:41:59,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:41:59,530 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:41:59,530 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:41:59,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:41:59,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:41:59,532 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 16:41:59,533 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 16:41:59,533 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:41:59,536 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 16:41:59,537 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:41:59,537 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:41:59,537 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter2~0) = 1*~counter2~0 Supporting invariants [] [2025-04-26 16:41:59,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-04-26 16:41:59,542 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:41:59,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:41:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 16:41:59,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 16:41:59,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:59,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:41:59,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:59,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:41:59,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:41:59,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:41:59,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:41:59,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:41:59,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:41:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:41:59,737 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 16:41:59,737 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81156 states and 110826 transitions. cyclomatic complexity: 30838 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 16:42:00,872 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81156 states and 110826 transitions. cyclomatic complexity: 30838. 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 206558 states and 281194 transitions. Complement of second has 15 states. [2025-04-26 16:42:00,873 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 16:42:00,873 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 16:42:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2025-04-26 16:42:00,874 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 286 transitions. Stem has 60 letters. Loop has 12 letters. [2025-04-26 16:42:00,874 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:00,874 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 286 transitions. Stem has 72 letters. Loop has 12 letters. [2025-04-26 16:42:00,874 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:00,874 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 286 transitions. Stem has 60 letters. Loop has 24 letters. [2025-04-26 16:42:00,874 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:00,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206558 states and 281194 transitions. [2025-04-26 16:42:02,452 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:42:03,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206558 states to 140713 states and 189604 transitions. [2025-04-26 16:42:03,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18437 [2025-04-26 16:42:03,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18459 [2025-04-26 16:42:03,078 INFO L74 IsDeterministic]: Start isDeterministic. Operand 140713 states and 189604 transitions. [2025-04-26 16:42:03,078 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:03,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140713 states and 189604 transitions. [2025-04-26 16:42:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140713 states and 189604 transitions. [2025-04-26 16:42:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140713 to 132372. [2025-04-26 16:42:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132372 states, 132372 states have (on average 1.3595020094884114) internal successors, (in total 179960), 132371 states have internal predecessors, (179960), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132372 states to 132372 states and 179960 transitions. [2025-04-26 16:42:05,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132372 states and 179960 transitions. [2025-04-26 16:42:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:42:05,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:42:05,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:42:05,389 INFO L87 Difference]: Start difference. First operand 132372 states and 179960 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 16:42:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:42:05,823 INFO L93 Difference]: Finished difference Result 132394 states and 179982 transitions. [2025-04-26 16:42:05,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132394 states and 179982 transitions. [2025-04-26 16:42:06,756 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:42:07,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132394 states to 132394 states and 179982 transitions. [2025-04-26 16:42:07,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18306 [2025-04-26 16:42:07,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18306 [2025-04-26 16:42:07,652 INFO L74 IsDeterministic]: Start isDeterministic. Operand 132394 states and 179982 transitions. [2025-04-26 16:42:07,652 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:07,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132394 states and 179982 transitions. [2025-04-26 16:42:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132394 states and 179982 transitions. [2025-04-26 16:42:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132394 to 132372. [2025-04-26 16:42:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132372 states, 132372 states have (on average 1.3595020094884114) internal successors, (in total 179960), 132371 states have internal predecessors, (179960), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132372 states to 132372 states and 179960 transitions. [2025-04-26 16:42:09,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132372 states and 179960 transitions. [2025-04-26 16:42:09,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:42:09,699 INFO L438 stractBuchiCegarLoop]: Abstraction has 132372 states and 179960 transitions. [2025-04-26 16:42:09,699 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:42:09,699 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132372 states and 179960 transitions. [2025-04-26 16:42:10,077 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:42:10,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:42:10,078 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:42:10,079 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 16:42:10,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:42:10,080 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 16:42:10,080 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 16:42:10,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1427870519, now seen corresponding path program 1 times [2025-04-26 16:42:10,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:10,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472832362] [2025-04-26 16:42:10,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:10,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:42:10,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:42:10,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:10,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:10,312 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 16:42:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:42:10,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472832362] [2025-04-26 16:42:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472832362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:42:10,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828998386] [2025-04-26 16:42:10,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:42:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,314 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 16:42:10,315 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 16:42:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:42:10,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:42:10,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:10,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:10,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:42:10,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:10,386 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 16:42:10,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:42:10,418 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 16:42:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828998386] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:42:10,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:42:10,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-26 16:42:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023054071] [2025-04-26 16:42:10,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:42:10,418 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:42:10,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 2 times [2025-04-26 16:42:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:10,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489839182] [2025-04-26 16:42:10,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:42:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:10,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:10,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:10,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:42:10,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:10,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:42:10,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:10,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:10,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:10,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:10,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:42:10,449 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:10,449 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:10,449 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:10,449 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:10,449 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:42:10,449 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,449 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:10,449 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:10,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration7_Loop [2025-04-26 16:42:10,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:10,449 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:10,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,527 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:10,527 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:42:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,529 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 16:42:10,529 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 16:42:10,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:10,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,540 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:10,541 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 16:42:10,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-04-26 16:42:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,548 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 16:42:10,548 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 16:42:10,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:10,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,566 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:10,567 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 16:42:10,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-04-26 16:42:10,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,574 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 16:42:10,575 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 16:42:10,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:10,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,593 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:10,593 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 16:42:10,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-04-26 16:42:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,601 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 16:42:10,601 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 16:42:10,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:10,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,619 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:10,620 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 16:42:10,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-04-26 16:42:10,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,627 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 16:42:10,627 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 16:42:10,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:10,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,644 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 16:42:10,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,646 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 16:42:10,647 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 16:42:10,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:42:10,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:10,735 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:42:10,739 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 16:42:10,739 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:10,739 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:10,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:10,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:10,739 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:42:10,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:10,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:10,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration7_Loop [2025-04-26 16:42:10,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:10,739 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:10,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:10,813 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:10,814 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:42:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,816 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 16:42:10,816 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 16:42:10,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:10,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:10,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:10,828 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:10,833 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 16:42:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,835 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 16:42:10,835 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 16:42:10,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:10,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:10,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:10,847 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:10,853 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 16:42:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,855 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 16:42:10,856 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 16:42:10,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:10,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:10,870 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:10,875 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 16:42:10,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,877 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 16:42:10,878 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 16:42:10,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:10,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:10,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:10,900 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 16:42:10,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,902 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 16:42:10,903 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 16:42:10,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:10,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:10,917 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:10,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,924 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 16:42:10,925 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 16:42:10,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:10,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:10,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:10,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:10,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:10,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:10,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:10,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:10,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:42:10,940 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:42:10,940 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:42:10,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:10,942 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 16:42:10,944 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 16:42:10,944 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:42:10,947 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 16:42:10,947 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:42:10,947 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:42:10,947 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 16:42:10,952 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 16:42:10,953 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:42:10,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:10,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:42:10,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:42:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:10,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:10,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:11,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:11,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:11,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:42:11,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:11,068 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 16:42:11,068 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439 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 16:42:12,555 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439. 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 304772 states and 414560 transitions. Complement of second has 11 states. [2025-04-26 16:42:12,555 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 16:42:12,556 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 16:42:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2025-04-26 16:42:12,556 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 302 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 16:42:12,556 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:12,556 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:42:12,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:12,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:42:12,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:42:12,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:12,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:12,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:12,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:12,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:12,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:12,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:12,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:42:12,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:12,668 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 16:42:12,668 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439 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 16:42:14,189 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439. 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 304772 states and 414560 transitions. Complement of second has 11 states. [2025-04-26 16:42:14,190 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 16:42:14,190 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 16:42:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2025-04-26 16:42:14,190 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 302 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 16:42:14,190 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:14,191 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:42:14,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:14,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:42:14,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:42:14,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:14,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:14,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:14,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:14,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:14,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:14,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:42:14,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:14,300 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 16:42:14,300 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439 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 16:42:16,134 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132372 states and 179960 transitions. cyclomatic complexity: 50439. 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 406263 states and 549666 transitions. Complement of second has 37 states. [2025-04-26 16:42:16,134 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 16:42:16,135 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 16:42:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 319 transitions. [2025-04-26 16:42:16,135 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 70 letters. Loop has 12 letters. [2025-04-26 16:42:16,135 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:16,135 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 82 letters. Loop has 12 letters. [2025-04-26 16:42:16,135 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:16,135 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 319 transitions. Stem has 70 letters. Loop has 24 letters. [2025-04-26 16:42:16,135 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:16,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 406263 states and 549666 transitions. [2025-04-26 16:42:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:42:19,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 406263 states to 112479 states and 150173 transitions. [2025-04-26 16:42:19,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15378 [2025-04-26 16:42:19,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21197 [2025-04-26 16:42:19,320 INFO L74 IsDeterministic]: Start isDeterministic. Operand 112479 states and 150173 transitions. [2025-04-26 16:42:19,320 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:19,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112479 states and 150173 transitions. [2025-04-26 16:42:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112479 states and 150173 transitions. [2025-04-26 16:42:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112479 to 99827. [2025-04-26 16:42:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99827 states, 99827 states have (on average 1.3363619060975487) internal successors, (in total 133405), 99826 states have internal predecessors, (133405), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99827 states to 99827 states and 133405 transitions. [2025-04-26 16:42:20,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99827 states and 133405 transitions. [2025-04-26 16:42:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:42:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 16:42:20,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-26 16:42:20,927 INFO L87 Difference]: Start difference. First operand 99827 states and 133405 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 16:42:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:42:21,355 INFO L93 Difference]: Finished difference Result 106378 states and 141455 transitions. [2025-04-26 16:42:21,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106378 states and 141455 transitions. [2025-04-26 16:42:22,039 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 696 [2025-04-26 16:42:22,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106378 states to 106369 states and 141441 transitions. [2025-04-26 16:42:22,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19875 [2025-04-26 16:42:22,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19875 [2025-04-26 16:42:22,489 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106369 states and 141441 transitions. [2025-04-26 16:42:22,489 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:22,489 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106369 states and 141441 transitions. [2025-04-26 16:42:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106369 states and 141441 transitions. [2025-04-26 16:42:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106369 to 99819. [2025-04-26 16:42:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99819 states, 99819 states have (on average 1.3363087187809937) internal successors, (in total 133389), 99818 states have internal predecessors, (133389), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99819 states to 99819 states and 133389 transitions. [2025-04-26 16:42:24,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99819 states and 133389 transitions. [2025-04-26 16:42:24,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 16:42:24,033 INFO L438 stractBuchiCegarLoop]: Abstraction has 99819 states and 133389 transitions. [2025-04-26 16:42:24,033 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:42:24,033 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99819 states and 133389 transitions. [2025-04-26 16:42:24,528 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 552 [2025-04-26 16:42:24,529 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:42:24,529 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:42:24,529 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 16:42:24,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:42:24,530 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 16:42:24,530 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 16:42:24,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -385729463, now seen corresponding path program 1 times [2025-04-26 16:42:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:24,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958180650] [2025-04-26 16:42:24,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:24,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 16:42:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 16:42:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:24,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:42:24,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 16:42:24,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 16:42:24,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:24,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:24,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:42:24,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 3 times [2025-04-26 16:42:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:24,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301592638] [2025-04-26 16:42:24,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:42:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:24,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:24,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:24,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:42:24,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:24,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:42:24,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:24,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:24,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:42:24,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -498210304, now seen corresponding path program 1 times [2025-04-26 16:42:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:24,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416784866] [2025-04-26 16:42:24,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:24,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-26 16:42:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-26 16:42:24,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:24,671 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 16:42:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:42:24,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416784866] [2025-04-26 16:42:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416784866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:42:24,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115604251] [2025-04-26 16:42:24,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:24,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:42:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:24,674 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 16:42:24,675 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 16:42:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-26 16:42:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-26 16:42:24,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:24,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:24,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:42:24,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:24,855 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 16:42:24,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:42:24,956 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 16:42:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115604251] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:42:24,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:42:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-26 16:42:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525355511] [2025-04-26 16:42:24,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:42:24,981 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:24,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:24,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:24,982 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:24,982 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:42:24,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:24,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:24,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:24,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration8_Loop [2025-04-26 16:42:24,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:24,982 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:24,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:24,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:24,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:24,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:24,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,071 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:25,071 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:42:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,073 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 16:42:25,074 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 16:42:25,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:25,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,093 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:25,093 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 16:42:25,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,101 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 16:42:25,101 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 16:42:25,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:25,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,120 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:25,120 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 16:42:25,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-04-26 16:42:25,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,128 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 16:42:25,128 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 16:42:25,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:25,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,147 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:25,147 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 16:42:25,152 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 16:42:25,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,154 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 16:42:25,155 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 16:42:25,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:25,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,174 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:25,174 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 16:42:25,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:25,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,182 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 16:42:25,182 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 16:42:25,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:25,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,199 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 16:42:25,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,201 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 16:42:25,201 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 16:42:25,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:42:25,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:25,224 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:42:25,227 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 16:42:25,228 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:25,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:25,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:25,228 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:25,228 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:42:25,228 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,228 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:25,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:25,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration8_Loop [2025-04-26 16:42:25,228 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:25,228 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:25,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:25,309 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:25,309 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:42:25,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,311 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 16:42:25,312 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 16:42:25,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:25,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:25,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:25,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:25,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:25,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:25,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:25,326 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:25,332 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 16:42:25,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,334 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 16:42:25,335 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 16:42:25,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:25,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:25,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:25,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:25,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:25,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:25,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:25,351 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:25,356 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 16:42:25,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,359 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 16:42:25,359 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 16:42:25,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:25,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:25,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:25,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:25,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:25,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:25,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:25,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:25,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:25,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,380 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 16:42:25,381 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 16:42:25,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:25,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:25,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:25,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:25,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:25,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:25,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:25,394 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:25,400 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 16:42:25,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,402 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 16:42:25,402 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 16:42:25,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:25,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:25,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:25,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:25,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:25,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:25,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:25,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:25,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:42:25,417 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:42:25,417 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:42:25,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:25,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:25,419 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 16:42:25,420 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 16:42:25,421 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:42:25,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-04-26 16:42:25,424 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:42:25,424 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:42:25,424 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter2~0) = 1*~counter2~0 Supporting invariants [] [2025-04-26 16:42:25,429 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 16:42:25,429 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:42:25,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:25,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-26 16:42:25,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-26 16:42:25,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:25,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:25,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:25,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:25,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:25,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:25,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:25,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:25,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:42:25,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:25,631 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 16:42:25,631 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99819 states and 133389 transitions. cyclomatic complexity: 35248 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 16:42:26,285 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99819 states and 133389 transitions. cyclomatic complexity: 35248. 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 116650 states and 155960 transitions. Complement of second has 14 states. [2025-04-26 16:42:26,285 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 16:42:26,285 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 16:42:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-04-26 16:42:26,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 278 transitions. Stem has 84 letters. Loop has 12 letters. [2025-04-26 16:42:26,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:26,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 278 transitions. Stem has 96 letters. Loop has 12 letters. [2025-04-26 16:42:26,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:26,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 278 transitions. Stem has 84 letters. Loop has 24 letters. [2025-04-26 16:42:26,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:26,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116650 states and 155960 transitions. [2025-04-26 16:42:26,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:27,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116650 states to 66720 states and 86955 transitions. [2025-04-26 16:42:27,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2191 [2025-04-26 16:42:27,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2798 [2025-04-26 16:42:27,199 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66720 states and 86955 transitions. [2025-04-26 16:42:27,199 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:27,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66720 states and 86955 transitions. [2025-04-26 16:42:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66720 states and 86955 transitions. [2025-04-26 16:42:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66720 to 52994. [2025-04-26 16:42:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52994 states, 52994 states have (on average 1.3193757783900064) internal successors, (in total 69919), 52993 states have internal predecessors, (69919), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52994 states to 52994 states and 69919 transitions. [2025-04-26 16:42:28,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52994 states and 69919 transitions. [2025-04-26 16:42:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:42:28,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-26 16:42:28,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-26 16:42:28,056 INFO L87 Difference]: Start difference. First operand 52994 states and 69919 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 16:42:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:42:28,439 INFO L93 Difference]: Finished difference Result 62977 states and 81875 transitions. [2025-04-26 16:42:28,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62977 states and 81875 transitions. [2025-04-26 16:42:28,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:28,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62977 states to 53162 states and 70110 transitions. [2025-04-26 16:42:28,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2639 [2025-04-26 16:42:28,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2639 [2025-04-26 16:42:28,795 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53162 states and 70110 transitions. [2025-04-26 16:42:28,795 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:28,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53162 states and 70110 transitions. [2025-04-26 16:42:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53162 states and 70110 transitions. [2025-04-26 16:42:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53162 to 53018. [2025-04-26 16:42:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53018 states, 53018 states have (on average 1.3192312044965862) internal successors, (in total 69943), 53017 states have internal predecessors, (69943), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:42:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53018 states to 53018 states and 69943 transitions. [2025-04-26 16:42:29,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53018 states and 69943 transitions. [2025-04-26 16:42:29,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:42:29,513 INFO L438 stractBuchiCegarLoop]: Abstraction has 53018 states and 69943 transitions. [2025-04-26 16:42:29,513 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:42:29,513 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53018 states and 69943 transitions. [2025-04-26 16:42:29,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:29,779 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:42:29,779 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:42:29,780 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 16:42:29,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:42:29,781 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 16:42:29,781 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 16:42:29,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 788118697, now seen corresponding path program 1 times [2025-04-26 16:42:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:29,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069750518] [2025-04-26 16:42:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:29,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 16:42:29,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 16:42:29,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:30,038 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 16:42:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:42:30,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069750518] [2025-04-26 16:42:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069750518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:42:30,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115197149] [2025-04-26 16:42:30,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:42:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:42:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,040 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 16:42:30,042 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 16:42:30,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 16:42:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 16:42:30,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:30,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:30,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 16:42:30,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:30,486 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 16:42:30,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 16:42:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115197149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:42:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 16:42:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 33 [2025-04-26 16:42:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335286053] [2025-04-26 16:42:30,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:42:30,487 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:42:30,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 4 times [2025-04-26 16:42:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:30,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396352990] [2025-04-26 16:42:30,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:42:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:30,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-04-26 16:42:30,491 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 16:42:30,491 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:42:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:30,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:42:30,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:30,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:30,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:30,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:30,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:42:30,518 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:30,518 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:30,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:30,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:30,518 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:42:30,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:30,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:30,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration9_Loop [2025-04-26 16:42:30,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:30,519 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:30,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:30,609 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:30,609 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:42:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,611 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 16:42:30,614 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 16:42:30,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,625 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,625 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 16:42:30,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-04-26 16:42:30,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,632 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 16:42:30,634 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 16:42:30,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,652 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,652 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 16:42:30,657 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 16:42:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,659 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 16:42:30,660 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 16:42:30,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,680 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,680 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 16:42:30,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,687 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 16:42:30,688 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 16:42:30,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,707 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,707 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 16:42:30,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,715 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 16:42:30,716 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 16:42:30,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,735 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,735 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 16:42:30,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,742 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 16:42:30,744 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 16:42:30,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,762 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,763 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 16:42:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,771 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 16:42:30,771 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 16:42:30,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,791 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,791 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 16:42:30,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-04-26 16:42:30,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,799 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 16:42:30,799 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 16:42:30,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,812 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,812 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 16:42:30,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,820 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 16:42:30,821 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 16:42:30,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,840 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,840 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 16:42:30,846 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 16:42:30,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,849 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 16:42:30,849 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 16:42:30,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,862 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,862 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 16:42:30,868 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 16:42:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,870 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 16:42:30,871 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 16:42:30,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,890 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:30,890 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 16:42:30,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,897 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 16:42:30,898 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 16:42:30,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:30,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:30,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:30,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:30,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:30,919 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 16:42:30,919 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 16:42:30,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:42:30,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:31,009 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:42:31,014 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 16:42:31,014 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:31,014 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:31,014 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:31,014 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:31,014 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:42:31,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:31,014 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:31,014 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration9_Loop [2025-04-26 16:42:31,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:31,014 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:31,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:31,101 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:31,101 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:42:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,103 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 16:42:31,103 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 16:42:31,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:31,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:31,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:31,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,120 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 16:42:31,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,121 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 16:42:31,122 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 16:42:31,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 16:42:31,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,135 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,142 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 16:42:31,143 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 16:42:31,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:31,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:31,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:31,154 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:31,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,161 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 16:42:31,162 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 16:42:31,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,175 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,180 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 16:42:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,182 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 16:42:31,182 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 16:42:31,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,195 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,200 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 16:42:31,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,202 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 16:42:31,203 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 16:42:31,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-04-26 16:42:31,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,223 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 16:42:31,223 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 16:42:31,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,236 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,241 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 16:42:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,243 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 16:42:31,244 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 16:42:31,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,258 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,262 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 16:42:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,264 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 16:42:31,265 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 16:42:31,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,278 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,283 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 16:42:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,285 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 16:42:31,285 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 16:42:31,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:31,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:31,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:31,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,302 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 16:42:31,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,304 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 16:42:31,304 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 16:42:31,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:31,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:31,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:31,316 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,321 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 16:42:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,323 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 16:42:31,324 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 16:42:31,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:31,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:31,338 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:31,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,345 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 16:42:31,345 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 16:42:31,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:31,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:31,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:31,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:31,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:31,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:31,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:31,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:31,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:42:31,359 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:42:31,360 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:42:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:31,361 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 16:42:31,434 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:42:31,434 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 16:42:31,437 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:42:31,437 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 16:42:31,437 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:42:31,437 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:42:31,437 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 16:42:31,442 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 16:42:31,443 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:42:31,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:31,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-26 16:42:31,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-26 16:42:31,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:31,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:31,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:31,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:31,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:31,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:31,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:31,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:31,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:42:31,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:31,616 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 16:42:31,616 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53018 states and 69943 transitions. cyclomatic complexity: 18184 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 16:42:31,878 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53018 states and 69943 transitions. cyclomatic complexity: 18184. 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 63549 states and 84745 transitions. Complement of second has 11 states. [2025-04-26 16:42:31,878 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 16:42:31,879 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 16:42:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-04-26 16:42:31,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 142 letters. Loop has 12 letters. [2025-04-26 16:42:31,879 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:31,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 154 letters. Loop has 12 letters. [2025-04-26 16:42:31,879 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:31,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 208 transitions. Stem has 142 letters. Loop has 24 letters. [2025-04-26 16:42:31,880 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:31,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63549 states and 84745 transitions. [2025-04-26 16:42:32,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:32,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63549 states to 17730 states and 25503 transitions. [2025-04-26 16:42:32,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2025-04-26 16:42:32,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2025-04-26 16:42:32,121 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17730 states and 25503 transitions. [2025-04-26 16:42:32,122 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:32,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17730 states and 25503 transitions. [2025-04-26 16:42:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17730 states and 25503 transitions. [2025-04-26 16:42:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17730 to 16904. [2025-04-26 16:42:32,257 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 16:42:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16904 states to 16904 states and 24428 transitions. [2025-04-26 16:42:32,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16904 states and 24428 transitions. [2025-04-26 16:42:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:42:32,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-26 16:42:32,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2025-04-26 16:42:32,279 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 16:42:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:42:32,969 INFO L93 Difference]: Finished difference Result 29289 states and 40992 transitions. [2025-04-26 16:42:32,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29289 states and 40992 transitions. [2025-04-26 16:42:33,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:33,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29289 states to 26454 states and 37442 transitions. [2025-04-26 16:42:33,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2025-04-26 16:42:33,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2025-04-26 16:42:33,136 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26454 states and 37442 transitions. [2025-04-26 16:42:33,137 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:42:33,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26454 states and 37442 transitions. [2025-04-26 16:42:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26454 states and 37442 transitions. [2025-04-26 16:42:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26454 to 19436. [2025-04-26 16:42:33,309 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 16:42:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 27593 transitions. [2025-04-26 16:42:33,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19436 states and 27593 transitions. [2025-04-26 16:42:33,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-26 16:42:33,334 INFO L438 stractBuchiCegarLoop]: Abstraction has 19436 states and 27593 transitions. [2025-04-26 16:42:33,334 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:42:33,334 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19436 states and 27593 transitions. [2025-04-26 16:42:33,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-04-26 16:42:33,367 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:42:33,367 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:42:33,368 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 16:42:33,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:42:33,369 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 16:42:33,369 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 16:42:33,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2034604567, now seen corresponding path program 2 times [2025-04-26 16:42:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:33,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823200980] [2025-04-26 16:42:33,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:42:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:33,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-04-26 16:42:33,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 160 statements. [2025-04-26 16:42:33,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:42:33,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:33,477 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 16:42:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:42:33,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823200980] [2025-04-26 16:42:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823200980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:42:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:42:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:42:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416638235] [2025-04-26 16:42:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:42:33,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:42:33,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1578378824, now seen corresponding path program 5 times [2025-04-26 16:42:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:42:33,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100766335] [2025-04-26 16:42:33,478 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:42:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:42:33,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:33,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:33,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:42:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:33,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:42:33,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:33,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:33,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:33,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:42:33,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:42:33,514 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:33,514 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:33,514 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:33,515 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:33,515 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:42:33,515 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,515 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:33,515 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:33,515 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration10_Loop [2025-04-26 16:42:33,515 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:33,515 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:33,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,610 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:33,611 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:42:33,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,613 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 16:42:33,614 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 16:42:33,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,632 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:33,632 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 16:42:33,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,640 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 16:42:33,640 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 16:42:33,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,654 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:33,654 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 16:42:33,660 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 16:42:33,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,663 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 16:42:33,664 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 16:42:33,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,684 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:33,684 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 16:42:33,689 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 16:42:33,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,691 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 16:42:33,693 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 16:42:33,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,712 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:33,712 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 16:42:33,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,720 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 16:42:33,721 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 16:42:33,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,734 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:42:33,734 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 16:42:33,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:33,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,742 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 16:42:33,743 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 16:42:33,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:42:33,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,762 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 16:42:33,762 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 16:42:33,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:42:33,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:42:33,848 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:42:33,852 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 16:42:33,852 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:42:33,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:42:33,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:42:33,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:42:33,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:42:33,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:42:33,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:42:33,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-counter-determinism.wvr.c_petrified1_Iteration10_Loop [2025-04-26 16:42:33,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:42:33,852 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:42:33,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:42:33,923 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:42:33,923 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:42:33,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,925 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 16:42:33,926 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 16:42:33,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:33,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:33,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:33,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:33,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:33,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:33,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:33,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:33,938 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:33,943 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 16:42:33,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,945 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 16:42:33,946 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 16:42:33,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:33,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:33,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:33,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:33,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:33,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:33,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:33,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:33,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,966 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 16:42:33,967 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 16:42:33,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 16:42:33,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:33,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:33,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:33,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:33,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:42:33,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:42:33,980 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:42:33,985 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 16:42:33,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:33,987 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 16:42:33,988 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 16:42:33,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:42:33,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:42:33,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:42:33,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:42:33,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:42:33,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:42:33,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:42:33,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:42:34,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:42:34,001 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:42:34,001 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:42:34,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:42:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:42:34,003 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 16:42:34,004 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 16:42:34,005 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:42:34,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:34,008 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:42:34,008 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:42:34,008 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 16:42:34,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:34,013 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:42:34,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:42:34,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-26 16:42:34,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-26 16:42:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:34,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:34,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:42:34,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:34,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:42:34,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:42:34,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:42:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:42:34,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:42:34,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:42:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:42:34,201 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 16:42:34,201 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 16:42:34,346 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 16:42:34,346 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 16:42:34,347 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 16:42:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-26 16:42:34,347 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 160 letters. Loop has 12 letters. [2025-04-26 16:42:34,347 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:34,347 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 172 letters. Loop has 12 letters. [2025-04-26 16:42:34,347 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:34,347 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 112 transitions. Stem has 160 letters. Loop has 24 letters. [2025-04-26 16:42:34,348 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:42:34,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19491 states and 27657 transitions. [2025-04-26 16:42:34,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:42:34,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19491 states to 0 states and 0 transitions. [2025-04-26 16:42:34,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:42:34,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:42:34,401 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:42:34,401 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:42:34,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:42:34,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:42:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:42:34,402 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 16:42:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:42:34,402 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:42:34,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:42:34,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:42:34,402 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:42:34,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:42:34,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:42:34,403 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:42:34,403 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:42:34,403 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:42:34,403 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:42:34,403 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:42:34,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:42:34,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:42:34 BoogieIcfgContainer [2025-04-26 16:42:34,414 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:42:34,414 INFO L158 Benchmark]: Toolchain (without parser) took 70330.54ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 100.0MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-04-26 16:42:34,414 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:42:34,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.01ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 86.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:42:34,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:42:34,415 INFO L158 Benchmark]: Boogie Preprocessor took 21.70ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.6MB in the end (delta: 967.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:42:34,415 INFO L158 Benchmark]: RCFGBuilder took 299.46ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 68.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:42:34,415 INFO L158 Benchmark]: BuchiAutomizer took 69738.72ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 68.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-04-26 16:42:34,416 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.01ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 86.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.70ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.6MB in the end (delta: 967.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 299.46ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 68.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 69738.72ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 68.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.6s and 11 iterations. TraceHistogramMax:10. Analysis of lassos took 9.7s. Construction of modules took 1.2s. Büchi inclusion checks took 28.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 18.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 95170 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 17.6s 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, 5084 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5070 mSDsluCounter, 11477 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8113 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3036 IncrementalHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 3364 mSDtfsCounter, 3036 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: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 62 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.2s InitialAbstractionConstructionTime: 3.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 3608, Number of transitions in reduction automaton: 57847, Number of states in reduction automaton: 41013, 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 16:42:34,426 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 16:42:34,630 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 16:42:34,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2025-04-26 16:42:35,031 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...