/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:31:52,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:31:52,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:31:52,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:31:52,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:31:52,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:31:52,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:31:52,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:31:52,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:31:52,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:31:52,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:31:52,552 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:31:52,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:31:52,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:31:52,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:31:52,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:31:52,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:31:52,554 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:31:52,554 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:31:52,554 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:31:52,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:31:52,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:31:52,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:31:52,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:31:52,764 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:31:52,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-04-26 18:31:54,008 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/423ca2610/c4aedd3cf7494765a5487a566a4cf3a8/FLAGf4bdab1e6 [2025-04-26 18:31:54,174 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:31:54,174 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-04-26 18:31:54,193 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/423ca2610/c4aedd3cf7494765a5487a566a4cf3a8/FLAGf4bdab1e6 [2025-04-26 18:31:55,209 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/423ca2610/c4aedd3cf7494765a5487a566a4cf3a8 [2025-04-26 18:31:55,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:31:55,212 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:31:55,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:31:55,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:31:55,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:31:55,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55, skipping insertion in model container [2025-04-26 18:31:55,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:31:55,376 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-04-26 18:31:55,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:31:55,390 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:31:55,416 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-04-26 18:31:55,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:31:55,425 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:31:55,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55 WrapperNode [2025-04-26 18:31:55,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:31:55,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:31:55,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:31:55,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:31:55,430 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:31:55" (1/1) ... [2025-04-26 18:31:55,436 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:31:55" (1/1) ... [2025-04-26 18:31:55,447 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-04-26 18:31:55,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:31:55,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:31:55,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:31:55,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:31:55,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:31:55,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:31:55,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:31:55,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:31:55,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (1/1) ... [2025-04-26 18:31:55,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:31:55,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:55,487 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:31:55,490 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:31:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:31:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:31:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 18:31:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:31:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:31:55,507 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:31:55,564 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:31:55,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:31:55,681 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:31:55,682 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:31:55,711 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:31:55,711 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:31:55,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:31:55 BoogieIcfgContainer [2025-04-26 18:31:55,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:31:55,712 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:31:55,712 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:31:55,716 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:31:55,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:31:55,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:31:55" (1/3) ... [2025-04-26 18:31:55,717 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2cc5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:31:55, skipping insertion in model container [2025-04-26 18:31:55,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:31:55,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:31:55" (2/3) ... [2025-04-26 18:31:55,717 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2cc5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:31:55, skipping insertion in model container [2025-04-26 18:31:55,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:31:55,718 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:31:55" (3/3) ... [2025-04-26 18:31:55,719 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2025-04-26 18:31:55,788 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:31:55,821 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:31:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:31:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:55,823 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:31:55,825 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:31:55,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 168 flow [2025-04-26 18:31:55,908 INFO L116 PetriNetUnfolderBase]: 4/73 cut-off events. [2025-04-26 18:31:55,912 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:31:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 4/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-04-26 18:31:55,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 168 flow [2025-04-26 18:31:55,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 73 transitions, 158 flow [2025-04-26 18:31:55,920 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 76 places, 73 transitions, 158 flow [2025-04-26 18:31:55,920 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 73 transitions, 158 flow [2025-04-26 18:31:55,954 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 348 states, 346 states have (on average 2.3352601156069364) internal successors, (in total 808), 347 states have internal predecessors, (808), 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:31:55,955 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 348 states, 346 states have (on average 2.3352601156069364) internal successors, (in total 808), 347 states have internal predecessors, (808), 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:31:55,958 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:31:56,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 505#[L42, L53, L73-5]true [2025-04-26 18:31:56,025 WARN L140 AmpleReduction]: Number of pruned transitions: 191 [2025-04-26 18:31:56,025 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:31:56,025 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 17 [2025-04-26 18:31:56,026 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:72 [2025-04-26 18:31:56,026 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:140 [2025-04-26 18:31:56,026 WARN L145 AmpleReduction]: Times succ was already a loop node:20 [2025-04-26 18:31:56,026 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:13 [2025-04-26 18:31:56,026 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:31:56,027 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 229 states, 227 states have (on average 1.2819383259911894) internal successors, (in total 291), 228 states have internal predecessors, (291), 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:31:56,035 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:31:56,035 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:31:56,035 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:31:56,035 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:31:56,035 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:31:56,035 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:31:56,035 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:31:56,035 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:31:56,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 229 states, 227 states have (on average 1.2819383259911894) internal successors, (in total 291), 228 states have internal predecessors, (291), 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:31:56,056 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 108 [2025-04-26 18:31:56,057 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:31:56,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:31:56,062 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] [2025-04-26 18:31:56,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:31:56,062 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:31:56,063 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 229 states, 227 states have (on average 1.2819383259911894) internal successors, (in total 291), 228 states have internal predecessors, (291), 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:31:56,067 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 108 [2025-04-26 18:31:56,067 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:31:56,068 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:31:56,069 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] [2025-04-26 18:31:56,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:31:56,073 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[155] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[147] 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[]" "[167] 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[]" "[165] 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[]" "[136] L21-3-->L21-4: Formula: (and (= 34 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[185] L21-4-->L38: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0]" "[186] L38-->L38-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0]" "[137] L38-1-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0]" "[174] 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]" "[175] L-1-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~t2~0#1]" "[188] L65-->L65-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]" "[171] L65-1-->L67: 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]" "[170] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[143] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0]" "[131] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[173] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[142] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~M2~0]" "[125] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[132] L69-->L69-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< 0 v_~M2~0_5) (< 0 v_~M1~0_5)) 1 0)) InVars {~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5} OutVars{~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5, 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]" "[176] L69-1-->L34: 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]" "[145] L34-->L35: 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]" "[169] L35-->L34-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[]" "[163] L34-1-->L69-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]" "[154] L69-2-->L72: 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]" "[187] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1]" "[117] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[124] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[213] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[190] $Ultimate##0-->L41: 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]" "[191] L41-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" [2025-04-26 18:31:56,074 INFO L754 eck$LassoCheckResult]: Loop: "[193] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M1~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~M1~0=v_~M1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[]" "[195] L42-->L44: Formula: (= (+ v_~counter~0_14 1) v_~counter~0_13) InVars {~counter~0=v_~counter~0_14} OutVars{~counter~0=v_~counter~0_13, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1]" "[197] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[199] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[200] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" [2025-04-26 18:31:56,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -287271706, now seen corresponding path program 1 times [2025-04-26 18:31:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:56,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772213270] [2025-04-26 18:31:56,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:56,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:31:56,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:31:56,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:31:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:31:56,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:56,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash 212873635, now seen corresponding path program 1 times [2025-04-26 18:31:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:56,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354033689] [2025-04-26 18:31:56,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:56,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:31:56,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:31:56,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:56,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:31:56,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:31:56,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:56,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2110907358, now seen corresponding path program 1 times [2025-04-26 18:31:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:56,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307258423] [2025-04-26 18:31:56,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:56,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 18:31:56,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 18:31:56,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 18:31:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 18:31:56,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:56,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:56,269 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:31:56,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:31:56,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:31:56,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:31:56,270 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:31:56,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:31:56,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:31:56,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr-alt.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:31:56,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:31:56,271 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:31:56,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,396 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:31:56,396 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:31:56,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,399 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:31:56,401 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:31:56,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,423 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:31:56,423 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:31:56,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:31:56,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,431 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:31:56,432 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:31:56,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:31:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,451 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:31:56,451 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:31:56,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:31:56,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,478 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:31:56,479 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=0} Honda state: {~counter~0=0} Generalized eigenvectors: [{~counter~0=3}, {~counter~0=-2}, {~counter~0=0}] Lambdas: [1, 1, 1] Nus: [0, 1] [2025-04-26 18:31:56,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:31:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,486 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:31:56,487 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:31:56,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,507 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:31:56,508 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:31:56,513 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:31:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,515 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:31:56,515 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:31:56,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,533 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:31:56,533 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:31:56,538 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:31:56,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,540 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:31:56,540 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:31:56,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,559 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:31:56,559 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_1=-1} Honda state: {v_rep#funAddr~thread2.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:31:56,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:31:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,566 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:31:56,567 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:31:56,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:31:56,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:31:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,586 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:31:56,587 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:31:56,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:31:56,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:31:56,649 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:31:56,653 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:31:56,654 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:31:56,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:31:56,654 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:31:56,654 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:31:56,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:31:56,654 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:31:56,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:31:56,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr-alt.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:31:56,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:31:56,654 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:31:56,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:31:56,737 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:31:56,740 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:31:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,743 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:31:56,744 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:31:56,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:31:56,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:31:56,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:31:56,763 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:31:56,768 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:31:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,770 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:31:56,771 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:31:56,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:31:56,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:31:56,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:31:56,787 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:31:56,793 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:31:56,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,794 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:31:56,795 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:31:56,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:31:56,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:31:56,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:31:56,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:31:56,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:31:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,818 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:31:56,819 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:31:56,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:31:56,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:31:56,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:31:56,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:31:56,834 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:31:56,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:31:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,841 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:31:56,842 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:31:56,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:31:56,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:31:56,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:31:56,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:31:56,864 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:31:56,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,866 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:31:56,867 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:31:56,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:31:56,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:31:56,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:31:56,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:31:56,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:31:56,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:31:56,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:31:56,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:31:56,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:31:56,885 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:31:56,885 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:31:56,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:31:56,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:31:56,888 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:31:56,890 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:31:56,891 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:31:56,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:31:56,894 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:31:56,894 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:31:56,894 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M1~0, thread1Thread1of1ForFork1_~i~0) = 1*~M1~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2025-04-26 18:31:56,899 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:31:56,901 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:31:56,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:31:56,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:31:56,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:31:56,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:31:56,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:31:56,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:31:56,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:31:56,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:56,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:31:56,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:31:56,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:31:57,046 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:31:57,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 18:31:57,064 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 229 states, 227 states have (on average 1.2819383259911894) internal successors, (in total 291), 228 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (in total 36), 5 states have internal predecessors, (36), 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:31:57,155 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 229 states, 227 states have (on average 1.2819383259911894) internal successors, (in total 291), 228 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 7.2) internal successors, (in total 36), 5 states have internal predecessors, (36), 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 546 states and 706 transitions. Complement of second has 10 states. [2025-04-26 18:31:57,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:31:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (in total 36), 5 states have internal predecessors, (36), 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:31:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-04-26 18:31:57,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 116 transitions. Stem has 31 letters. Loop has 5 letters. [2025-04-26 18:31:57,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:31:57,166 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 116 transitions. Stem has 36 letters. Loop has 5 letters. [2025-04-26 18:31:57,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:31:57,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 116 transitions. Stem has 31 letters. Loop has 10 letters. [2025-04-26 18:31:57,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:31:57,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 706 transitions. [2025-04-26 18:31:57,177 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:31:57,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 158 states and 203 transitions. [2025-04-26 18:31:57,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-04-26 18:31:57,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 18:31:57,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 203 transitions. [2025-04-26 18:31:57,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:31:57,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 203 transitions. [2025-04-26 18:31:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 203 transitions. [2025-04-26 18:31:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-04-26 18:31:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 155 states have (on average 1.2838709677419355) internal successors, (in total 199), 154 states have internal predecessors, (199), 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:31:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2025-04-26 18:31:57,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 199 transitions. [2025-04-26 18:31:57,207 INFO L438 stractBuchiCegarLoop]: Abstraction has 155 states and 199 transitions. [2025-04-26 18:31:57,207 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:31:57,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 199 transitions. [2025-04-26 18:31:57,208 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:31:57,208 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:31:57,208 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:31:57,209 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] [2025-04-26 18:31:57,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:31:57,211 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[155] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[147] 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[]" "[167] 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[]" "[165] 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[]" "[136] L21-3-->L21-4: Formula: (and (= 34 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[185] L21-4-->L38: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0]" "[186] L38-->L38-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0]" "[137] L38-1-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0]" "[174] 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]" "[175] L-1-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#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~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~t2~0#1]" "[188] L65-->L65-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]" "[171] L65-1-->L67: 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]" "[170] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[143] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0]" "[131] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[173] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[142] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~M2~0]" "[125] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[132] L69-->L69-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< 0 v_~M2~0_5) (< 0 v_~M1~0_5)) 1 0)) InVars {~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5} OutVars{~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5, 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]" "[176] L69-1-->L34: 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]" "[145] L34-->L35: 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]" "[169] L35-->L34-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[]" "[163] L34-1-->L69-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]" "[154] L69-2-->L72: 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]" "[187] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1]" "[117] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[124] L72-2-->L72-3: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[213] L72-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_8|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[190] $Ultimate##0-->L41: 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]" "[191] L41-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0]" "[193] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M1~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~M1~0=v_~M1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[]" "[177] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1]" "[121] L72-5-->L73: 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]" "[150] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[162] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[151] L73-2-->L73-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t2~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[210] L73-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_6|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr.offset]" "[201] $Ultimate##0-->L51: 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]" "[202] L51-->L58: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 18:31:57,211 INFO L754 eck$LassoCheckResult]: Loop: "[204] L58-->L53: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M2~0_2) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M2~0=v_~M2~0_2} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M2~0=v_~M2~0_2} AuxVars[] AssignedVars[]" "[206] L53-->L58: Formula: (or (and (= v_~counter~0_32 v_~counter~0_31) (= v_thread2Thread1of1ForFork0_~i~1_8 v_thread2Thread1of1ForFork0_~i~1_7) (<= v_~counter~0_32 0) (= |v_thread2Thread1of1ForFork0_#t~post4_2| |v_thread2Thread1of1ForFork0_#t~post4_1|) (= |v_thread2Thread1of1ForFork0_#t~post3_2| |v_thread2Thread1of1ForFork0_#t~post3_1|)) (and (< 0 v_~counter~0_32) (= (+ v_thread2Thread1of1ForFork0_~i~1_7 1) v_thread2Thread1of1ForFork0_~i~1_8) (= (+ v_~counter~0_31 1) v_~counter~0_32))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~counter~0=v_~counter~0_32, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_1|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_8, ~counter~0=v_~counter~0_31, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_2|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4]" [2025-04-26 18:31:57,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1623516107, now seen corresponding path program 1 times [2025-04-26 18:31:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:57,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314811398] [2025-04-26 18:31:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:57,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:31:57,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:31:57,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:57,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:31:57,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:31:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:57,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 7491, now seen corresponding path program 1 times [2025-04-26 18:31:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:57,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990683642] [2025-04-26 18:31:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:57,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:31:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:31:57,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:31:57,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:31:57,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:57,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:31:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1125856909, now seen corresponding path program 1 times [2025-04-26 18:31:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:31:57,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620702806] [2025-04-26 18:31:57,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:31:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:31:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:31:57,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:31:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:57,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 18:31:57,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 18:31:57,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:31:57,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:31:57,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:31:57,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:31:57,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:31:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:31:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:31:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:31:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:31:57,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:31:57 BoogieIcfgContainer [2025-04-26 18:31:57,857 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:31:57,858 INFO L158 Benchmark]: Toolchain (without parser) took 2645.37ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 105.2MB in the end (delta: -5.0MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2025-04-26 18:31:57,858 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:31:57,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.63ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 85.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:31:57,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.36ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 990.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:31:57,858 INFO L158 Benchmark]: Boogie Preprocessor took 12.13ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:31:57,859 INFO L158 Benchmark]: RCFGBuilder took 248.67ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 70.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 18:31:57,859 INFO L158 Benchmark]: BuchiAutomizer took 2145.38ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 105.2MB in the end (delta: -35.2MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. [2025-04-26 18:31:57,863 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.79ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.63ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 85.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.36ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 990.1kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.13ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 248.67ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 70.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 2145.38ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 105.2MB in the end (delta: -35.2MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 50 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax288 hnf100 lsp24 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 208, Number of transitions in reduction automaton: 291, Number of states in reduction automaton: 229, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * i) + M1) and consists of 6 locations. The remainder module has 155 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 52]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 int M1, M2, counter; VAL [M1=0, M2=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M1=0, M2=0, counter=0] [L67] 0 M1 = __VERIFIER_nondet_int() VAL [M1=1, M2=0, counter=0] [L68] 0 M2 = __VERIFIER_nondet_int() VAL [M1=1, M2=1, counter=0] [L69] CALL 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L35] COND FALSE 0 !(!cond) VAL [M1=1, M2=1, \at(cond, Pre)=1, cond=1, counter=0] [L69] RET 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M1=1, M2=1, \at(_argptr, Pre)={0:0}, counter=0, t1=-1] [L41] 1 int i=0; VAL [M1=1, M2=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L41] COND TRUE 1 i 0 [L55] counter-- [L56] i++ End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 52]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 int M1, M2, counter; VAL [M1=0, M2=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M1=0, M2=0, counter=0] [L67] 0 M1 = __VERIFIER_nondet_int() VAL [M1=1, M2=0, counter=0] [L68] 0 M2 = __VERIFIER_nondet_int() VAL [M1=1, M2=1, counter=0] [L69] CALL 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L35] COND FALSE 0 !(!cond) VAL [M1=1, M2=1, \at(cond, Pre)=1, cond=1, counter=0] [L69] RET 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M1=1, M2=1, \at(_argptr, Pre)={0:0}, counter=0, t1=-1] [L41] 1 int i=0; VAL [M1=1, M2=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L41] COND TRUE 1 i 0 [L55] counter-- [L56] i++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:31:57,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...