/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/parallel-misc-2-unrolled-atomic.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:26:23,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:26:23,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:26:23,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:26:23,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:26:23,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:26:23,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:26:23,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:26:23,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:26:23,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:26:23,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:26:23,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:26:23,905 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:26:23,905 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:26:23,905 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:26:23,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:26:23,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:26:23,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:26:23,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:26:23,907 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:26:23,907 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:26:24,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:26:24,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:26:24,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:26:24,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:26:24,135 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:26:24,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2025-04-26 18:26:25,370 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/16703aa6d/22708d2dff07497fbdb8b0f6173ddf03/FLAG03d49ac10 [2025-04-26 18:26:25,550 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:26:25,551 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2025-04-26 18:26:25,556 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/16703aa6d/22708d2dff07497fbdb8b0f6173ddf03/FLAG03d49ac10 [2025-04-26 18:26:26,371 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/16703aa6d/22708d2dff07497fbdb8b0f6173ddf03 [2025-04-26 18:26:26,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:26:26,374 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:26:26,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:26:26,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:26:26,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:26:26,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c6f1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26, skipping insertion in model container [2025-04-26 18:26:26,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:26:26,511 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/parallel-misc-2-unrolled-atomic.wvr.c[2278,2291] [2025-04-26 18:26:26,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:26:26,520 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:26:26,536 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/parallel-misc-2-unrolled-atomic.wvr.c[2278,2291] [2025-04-26 18:26:26,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:26:26,545 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:26:26,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26 WrapperNode [2025-04-26 18:26:26,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:26:26,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:26:26,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:26:26,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:26:26,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,568 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2025-04-26 18:26:26,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:26:26,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:26:26,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:26:26,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:26:26,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:26:26,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:26:26,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:26:26,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:26:26,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (1/1) ... [2025-04-26 18:26:26,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:26:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:26,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:26,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:26:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:26:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 18:26:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:26:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:26:26,629 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:26:26,680 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:26:26,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:26:26,776 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:26:26,776 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:26:26,807 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:26:26,807 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:26:26,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:26:26 BoogieIcfgContainer [2025-04-26 18:26:26,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:26:26,808 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:26:26,808 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:26:26,812 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:26:26,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:26,812 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:26:26" (1/3) ... [2025-04-26 18:26:26,813 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b492d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:26:26, skipping insertion in model container [2025-04-26 18:26:26,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:26,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:26" (2/3) ... [2025-04-26 18:26:26,813 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b492d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:26:26, skipping insertion in model container [2025-04-26 18:26:26,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:26,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:26:26" (3/3) ... [2025-04-26 18:26:26,814 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2025-04-26 18:26:26,858 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:26:26,898 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:26:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:26:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:26,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:26,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:26:26,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 86 transitions, 186 flow [2025-04-26 18:26:26,974 INFO L116 PetriNetUnfolderBase]: 5/82 cut-off events. [2025-04-26 18:26:26,975 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:26:26,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 82 events. 5/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-04-26 18:26:26,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 86 transitions, 186 flow [2025-04-26 18:26:26,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 82 transitions, 176 flow [2025-04-26 18:26:26,981 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 84 places, 82 transitions, 176 flow [2025-04-26 18:26:26,981 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 82 transitions, 176 flow [2025-04-26 18:26:27,009 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 208 states, 206 states have (on average 2.1019417475728157) internal successors, (in total 433), 207 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:27,010 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 208 states, 206 states have (on average 2.1019417475728157) internal successors, (in total 433), 207 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:27,012 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:26:27,063 WARN L140 AmpleReduction]: Number of pruned transitions: 99 [2025-04-26 18:26:27,063 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:26:27,063 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 26 [2025-04-26 18:26:27,063 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:75 [2025-04-26 18:26:27,063 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:69 [2025-04-26 18:26:27,063 WARN L145 AmpleReduction]: Times succ was already a loop node:34 [2025-04-26 18:26:27,063 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:26:27,063 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:26:27,064 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 171 states, 169 states have (on average 1.4201183431952662) internal successors, (in total 240), 170 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:27,072 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:26:27,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:26:27,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:26:27,073 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:26:27,073 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:26:27,073 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:26:27,073 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:26:27,073 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:26:27,076 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 169 states have (on average 1.4201183431952662) internal successors, (in total 240), 170 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:27,092 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:26:27,093 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:27,093 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:27,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:26:27,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:26:27,099 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:26:27,100 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 169 states have (on average 1.4201183431952662) internal successors, (in total 240), 170 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:27,106 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:26:27,106 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:27,106 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:27,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:26:27,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:26:27,112 INFO L752 eck$LassoCheckResult]: Stem: "[170] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[177] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[169] 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[]" "[191] 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[]" "[185] 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[]" "[154] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[215] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0]" "[200] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0]" "[201] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0]" "[155] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[202] 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]" "[205] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t2~0#1]" "[173] L66-->L66-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]" "[206] L66-1-->L69: 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]" "[149] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[207] L69-1-->L69-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0]" "[174] L69-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[218] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[163] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0]" "[162] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[145] L71-->L71-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]" "[157] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) 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|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0]" "[203] L71-2-->L72: 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]" "[217] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[140] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[146] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[210] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[168] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[158] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[165] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[197] L33-1-->L75-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[190] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[219] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[188] L76-1-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[159] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[152] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[216] L33-3-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[198] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[156] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[160] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[181] L78-2-->L78-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[239] L78-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_4|, thread1Thread1of1ForFork1_#t~post4=|v_thread1Thread1of1ForFork1_#t~post4_4|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[222] $Ultimate##0-->L46: 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]" [2025-04-26 18:26:27,113 INFO L754 eck$LassoCheckResult]: Loop: "[224] L46-->L41: Formula: (< v_~i1~0_1 (* 2 v_~N~0_1)) InVars {~i1~0=v_~i1~0_1, ~N~0=v_~N~0_1} OutVars{~i1~0=v_~i1~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[226] L41-->L46: Formula: (and (= v_~pos~0_33 v_~pos~0_31) (= v_~i1~0_34 (+ v_~i1~0_36 2))) InVars {~i1~0=v_~i1~0_36, ~pos~0=v_~pos~0_33} OutVars{thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_1|, thread1Thread1of1ForFork1_#t~post4=|v_thread1Thread1of1ForFork1_#t~post4_1|, ~i1~0=v_~i1~0_34, ~pos~0=v_~pos~0_31, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork1_#t~post4, ~i1~0, ~pos~0]" [2025-04-26 18:26:27,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1090200535, now seen corresponding path program 1 times [2025-04-26 18:26:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:27,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607668990] [2025-04-26 18:26:27,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:26:27,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:26:27,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:27,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:26:27,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:26:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:27,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash 8131, now seen corresponding path program 1 times [2025-04-26 18:26:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:27,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129409164] [2025-04-26 18:26:27,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:27,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:27,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:27,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:27,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:27,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:27,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:27,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -289298919, now seen corresponding path program 1 times [2025-04-26 18:26:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:27,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740508237] [2025-04-26 18:26:27,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:27,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:26:27,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:26:27,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:27,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:26:27,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:26:27,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:27,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:27,364 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:26:27,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:26:27,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:26:27,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:26:27,365 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:26:27,366 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,366 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:26:27,366 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:26:27,366 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:26:27,366 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:26:27,366 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:26:27,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,487 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:26:27,487 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:26:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:27,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:27,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:26:27,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:27,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:27,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:27,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:26:27,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:26:27,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:27,590 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:26:27,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:27,595 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:26:27,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:26:27,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:26:27,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:26:27,595 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:26:27,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:26:27,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:26:27,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:26:27,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:26:27,595 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:26:27,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:27,705 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:26:27,709 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:26:27,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:27,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:27,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:26:27,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:27,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:27,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:26:27,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:27,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:27,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:27,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:26:27,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:26:27,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:26:27,736 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:26:27,736 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:26:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:27,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:27,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:26:27,742 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:26:27,745 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 18:26:27,745 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:26:27,746 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:26:27,746 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~N~0) = -1*~i1~0 + 2*~N~0 Supporting invariants [] [2025-04-26 18:26:27,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:27,754 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:26:27,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:27,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:26:27,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:26:27,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:27,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:26:27,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:26:27,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:27,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:27,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:27,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:27,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:26:27,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:26:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:26:27,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:26:27,907 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 171 states, 169 states have (on average 1.4201183431952662) internal successors, (in total 240), 170 states have internal predecessors, (240), 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 3 states, 3 states have (on average 15.0) internal successors, (in total 45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:28,001 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 171 states, 169 states have (on average 1.4201183431952662) internal successors, (in total 240), 170 states have internal predecessors, (240), 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 3 states, 3 states have (on average 15.0) internal successors, (in total 45), 3 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 456 states and 677 transitions. Complement of second has 7 states. [2025-04-26 18:26:28,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:26:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (in total 45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2025-04-26 18:26:28,013 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 43 letters. Loop has 2 letters. [2025-04-26 18:26:28,014 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:28,014 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 45 letters. Loop has 2 letters. [2025-04-26 18:26:28,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:28,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 43 letters. Loop has 4 letters. [2025-04-26 18:26:28,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:28,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 677 transitions. [2025-04-26 18:26:28,025 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:26:28,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 125 states and 170 transitions. [2025-04-26 18:26:28,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-04-26 18:26:28,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 18:26:28,033 INFO L74 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2025-04-26 18:26:28,033 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:26:28,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 170 transitions. [2025-04-26 18:26:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2025-04-26 18:26:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-04-26 18:26:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.3781512605042017) internal successors, (in total 164), 118 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 164 transitions. [2025-04-26 18:26:28,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 164 transitions. [2025-04-26 18:26:28,057 INFO L438 stractBuchiCegarLoop]: Abstraction has 119 states and 164 transitions. [2025-04-26 18:26:28,058 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:26:28,058 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 164 transitions. [2025-04-26 18:26:28,059 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:26:28,059 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:28,059 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:28,059 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] [2025-04-26 18:26:28,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:26:28,060 INFO L752 eck$LassoCheckResult]: Stem: "[170] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[177] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[169] 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[]" "[191] 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[]" "[185] 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[]" "[154] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[215] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0]" "[200] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0]" "[201] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0]" "[155] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[202] 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]" "[205] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t2~0#1]" "[173] L66-->L66-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]" "[206] L66-1-->L69: 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]" "[149] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[207] L69-1-->L69-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0]" "[174] L69-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[218] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[163] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0]" "[162] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[145] L71-->L71-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]" "[157] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) 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|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0]" "[203] L71-2-->L72: 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]" "[217] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[140] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[146] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[210] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[168] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[158] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[165] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[197] L33-1-->L75-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[190] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[219] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[188] L76-1-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[159] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[152] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[216] L33-3-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[198] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[156] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[160] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[181] L78-2-->L78-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[239] L78-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_4|, thread1Thread1of1ForFork1_#t~post4=|v_thread1Thread1of1ForFork1_#t~post4_4|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[222] $Ultimate##0-->L46: 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]" "[223] L46-->L49: Formula: (<= (* 2 v_~N~0_2) v_~i1~0_6) InVars {~i1~0=v_~i1~0_6, ~N~0=v_~N~0_2} OutVars{~i1~0=v_~i1~0_6, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[]" "[225] L49-->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]" "[227] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[178] L78-4-->L78-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[166] L78-5-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1]" "[196] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[186] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[175] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[236] L79-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_4|, thread2Thread1of1ForFork0_#t~post5=|v_thread2Thread1of1ForFork0_#t~post5_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#t~post5, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr.offset]" "[228] $Ultimate##0-->L59: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" [2025-04-26 18:26:28,061 INFO L754 eck$LassoCheckResult]: Loop: "[230] L59-->L54: Formula: (< v_~i2~0_3 (* 2 v_~N~0_4)) InVars {~i2~0=v_~i2~0_3, ~N~0=v_~N~0_4} OutVars{~i2~0=v_~i2~0_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[232] L54-->L59: Formula: (and (= v_~pos~0_63 v_~pos~0_61) (= (+ v_~i2~0_30 2) v_~i2~0_28)) InVars {~i2~0=v_~i2~0_30, ~pos~0=v_~pos~0_63} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|, thread2Thread1of1ForFork0_#t~post5=|v_thread2Thread1of1ForFork0_#t~post5_1|, ~i2~0=v_~i2~0_28, ~pos~0=v_~pos~0_61} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#t~post5, ~i2~0, ~pos~0]" [2025-04-26 18:26:28,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -83735757, now seen corresponding path program 1 times [2025-04-26 18:26:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:28,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174288171] [2025-04-26 18:26:28,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:28,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:26:28,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:26:28,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:28,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:28,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:26:28,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:26:28,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:28,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:28,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:28,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash 8323, now seen corresponding path program 1 times [2025-04-26 18:26:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:28,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723138115] [2025-04-26 18:26:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:28,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:28,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:28,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:28,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:28,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:28,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:28,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:28,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:28,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:28,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:28,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1134323509, now seen corresponding path program 1 times [2025-04-26 18:26:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:28,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785098369] [2025-04-26 18:26:28,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:28,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 18:26:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 18:26:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:26:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:26:28,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785098369] [2025-04-26 18:26:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785098369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:26:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:26:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:26:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477636730] [2025-04-26 18:26:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:26:28,393 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:26:28,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:26:28,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:26:28,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:26:28,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:26:28,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:26:28,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:26:28,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:26:28,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:26:28,394 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:26:28,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,481 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:26:28,481 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:26:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:26:28,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,497 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,498 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post6=0} Honda state: {thread2Thread1of1ForFork0_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,504 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 18:26:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,508 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:26:28,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,522 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,522 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post5=0} Honda state: {thread2Thread1of1ForFork0_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:26:28,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,548 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,549 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:26:28,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:26:28,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,575 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,575 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:26:28,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:26:28,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,606 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,606 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:26:28,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,613 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:26:28,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,627 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,627 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~pos~0=0} Honda state: {~pos~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:26:28,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:26:28,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,653 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:26:28,653 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_3=0} Honda state: {v_rep#funAddr~thread1.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:26:28,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:26:28,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:26:28,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:26:28,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:26:28,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:26:28,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:26:28,755 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:26:28,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:26:28,760 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:26:28,760 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:26:28,760 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:26:28,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:26:28,760 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:26:28,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:26:28,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:26:28,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:26:28,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:26:28,760 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:26:28,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:26:28,828 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:26:28,828 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:26:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,831 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:26:28,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:26:28,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:26:28,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:26:28,846 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:26:28,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:26:28,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:26:28,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:26:28,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:26:28,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,875 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:26:28,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:26:28,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:26:28,892 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:28,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,900 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:26:28,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:26:28,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:26:28,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:26:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,923 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:26:28,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 18:26:28,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:26:28,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:26:28,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:26:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,951 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:26:28,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:26:28,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:26:28,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:26:28,966 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:26:28,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:28,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:26:28,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:26:28,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:26:28,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:26:28,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:26:28,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:26:28,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:26:28,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:26:28,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:26:28,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:26:28,988 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:26:28,988 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:26:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:26:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:28,990 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:26:28,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:26:28,992 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:26:28,995 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 18:26:28,995 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:26:28,995 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:26:28,995 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~N~0) = -1*~i2~0 + 2*~N~0 Supporting invariants [] [2025-04-26 18:26:29,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:29,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:26:29,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:29,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 18:26:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 18:26:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:26:29,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:26:29,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:26:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:26:29,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:29,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:29,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:26:29,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:26:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:26:29,112 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:26:29,113 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 164 transitions. cyclomatic complexity: 61 Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (in total 55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:29,160 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 164 transitions. cyclomatic complexity: 61. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (in total 55), 3 states have internal predecessors, (55), 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 177 states and 257 transitions. Complement of second has 6 states. [2025-04-26 18:26:29,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:26:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (in total 55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 18:26:29,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 53 letters. Loop has 2 letters. [2025-04-26 18:26:29,165 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:29,165 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 55 letters. Loop has 2 letters. [2025-04-26 18:26:29,165 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:29,165 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 53 letters. Loop has 4 letters. [2025-04-26 18:26:29,165 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:26:29,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 257 transitions. [2025-04-26 18:26:29,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:26:29,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 0 states and 0 transitions. [2025-04-26 18:26:29,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:26:29,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:26:29,166 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:26:29,166 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:26:29,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:26:29,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:26:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:26:29,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:26:29,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:26:29,169 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (in total 55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:26:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:26:29,171 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:26:29,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:26:29,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:26:29,171 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:26:29,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:26:29,171 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:26:29,171 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:26:29,171 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:26:29,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:26:29,172 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:26:29,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:26:29,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:26:29 BoogieIcfgContainer [2025-04-26 18:26:29,182 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:26:29,182 INFO L158 Benchmark]: Toolchain (without parser) took 2807.96ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 75.1MB in the end (delta: 34.1MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2025-04-26 18:26:29,182 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:26:29,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.99ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 95.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:26:29,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.41ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:26:29,183 INFO L158 Benchmark]: Boogie Preprocessor took 18.48ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:26:29,183 INFO L158 Benchmark]: RCFGBuilder took 219.32ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 77.6MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:26:29,183 INFO L158 Benchmark]: BuchiAutomizer took 2373.62ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 75.1MB in the end (delta: 2.5MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2025-04-26 18:26:29,184 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.78ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.99ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 95.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.41ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.48ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 219.32ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 77.6MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2373.62ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 75.1MB in the end (delta: 2.5MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 127 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax288 hnf100 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 172, Number of transitions in reduction automaton: 240, Number of states in reduction automaton: 171, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) 2 * N) + ((long long) -1 * i1)) and consists of 5 locations. One deterministic module has affine ranking function (((long long) 2 * N) + ((long long) -1 * i2)) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:26:29,197 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...