/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/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:02,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:02,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:02,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:02,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:02,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:02,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:02,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:02,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:02,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:02,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:02,283 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:02,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:02,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:02,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:02,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:02,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:02,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:02,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:02,285 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:02,285 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:02,285 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:02,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:02,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:02,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:02,508 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:02,509 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:02,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl [2025-04-26 18:39:02,510 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl' [2025-04-26 18:39:02,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:02,529 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:02,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:02,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:02,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,565 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:02,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:02,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:02,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:02,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:02,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:02,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:02,619 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:39:02,622 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:39:02,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:02,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:02,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:02,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:02,646 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:39:02,683 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:02,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:02,790 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:02,790 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:02,800 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:02,801 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:02,801 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:02 BoogieIcfgContainer [2025-04-26 18:39:02,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:02,802 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:02,802 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:02,807 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:02,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:02,807 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/2) ... [2025-04-26 18:39:02,809 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dd60bcd and model type map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:02, skipping insertion in model container [2025-04-26 18:39:02,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:02,809 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:02" (2/2) ... [2025-04-26 18:39:02,810 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-2modifiers.bpl [2025-04-26 18:39:02,875 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:39:02,911 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:02,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:02,913 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:39:02,915 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:39:02,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 18:39:02,981 INFO L116 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-04-26 18:39:02,982 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:39:02,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 6/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 18:39:02,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 18:39:02,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 108 flow [2025-04-26 18:39:02,989 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 49 places, 42 transitions, 108 flow [2025-04-26 18:39:02,990 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 42 transitions, 108 flow [2025-04-26 18:39:03,153 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2994 states, 2992 states have (on average 4.153074866310161) internal successors, (in total 12426), 2993 states have internal predecessors, (12426), 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:39:03,162 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2994 states, 2992 states have (on average 4.153074866310161) internal successors, (in total 12426), 2993 states have internal predecessors, (12426), 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:39:03,165 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:03,466 WARN L140 AmpleReduction]: Number of pruned transitions: 3070 [2025-04-26 18:39:03,466 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:03,468 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 331 [2025-04-26 18:39:03,468 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 18:39:03,468 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1059 [2025-04-26 18:39:03,469 WARN L145 AmpleReduction]: Times succ was already a loop node:194 [2025-04-26 18:39:03,469 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:668 [2025-04-26 18:39:03,469 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:03,471 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1428 states, 1426 states have (on average 2.023141654978962) internal successors, (in total 2885), 1427 states have internal predecessors, (2885), 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:39:03,478 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:03,478 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:03,478 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:03,478 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:03,478 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:03,479 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:03,479 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:03,479 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:03,483 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1428 states, 1426 states have (on average 2.023141654978962) internal successors, (in total 2885), 1427 states have internal predecessors, (2885), 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:39:03,537 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 1102 [2025-04-26 18:39:03,537 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:03,537 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:03,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:03,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:03,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:03,544 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1428 states, 1426 states have (on average 2.023141654978962) internal successors, (in total 2885), 1427 states have internal predecessors, (2885), 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:39:03,570 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 1102 [2025-04-26 18:39:03,570 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:03,570 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:03,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:03,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:03,575 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 18:39:03,575 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 18:39:03,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash 117427, now seen corresponding path program 1 times [2025-04-26 18:39:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:03,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144360869] [2025-04-26 18:39:03,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:03,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:03,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:03,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:03,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:03,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:03,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 18:39:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:03,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752471722] [2025-04-26 18:39:03,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:03,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:03,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:03,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:03,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:03,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:03,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -796606132, now seen corresponding path program 1 times [2025-04-26 18:39:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:03,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657936246] [2025-04-26 18:39:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:03,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:03,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:03,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:03,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:03,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:03,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:03,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:03,855 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:03,855 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:03,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:03,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:03,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:03,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:03,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:03,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:03,856 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:03,856 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:03,856 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:03,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:03,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:03,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:03,964 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:03,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:03,968 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:39:03,969 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:39:03,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:03,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:03,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:03,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:03,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:03,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:03,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:03,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:04,002 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:39:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:04,004 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:39:04,006 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:39:04,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:04,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:04,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:04,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:04,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:04,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:04,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:04,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:04,021 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:04,030 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:39:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:04,032 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:39:04,034 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:39:04,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:04,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:04,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:04,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:04,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:04,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:04,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:04,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:04,073 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:04,073 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:04,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:04,090 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:39:04,091 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:39:04,091 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:04,107 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:39:04,107 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:04,108 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:04,108 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_i, N) = -1*thread1Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 18:39:04,114 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:39:04,116 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:04,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:04,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:04,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:04,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:04,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:04,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:04,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:04,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:04,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:04,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:04,177 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:39:04,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:04,199 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1428 states, 1426 states have (on average 2.023141654978962) internal successors, (in total 2885), 1427 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:39:04,357 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1428 states, 1426 states have (on average 2.023141654978962) internal successors, (in total 2885), 1427 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 3271 states and 6644 transitions. Complement of second has 6 states. [2025-04-26 18:39:04,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:39:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 18:39:04,368 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:39:04,369 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:04,369 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:39:04,369 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:04,369 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:39:04,370 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:04,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3271 states and 6644 transitions. [2025-04-26 18:39:04,401 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 262 [2025-04-26 18:39:04,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3271 states to 1863 states and 3660 transitions. [2025-04-26 18:39:04,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2025-04-26 18:39:04,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 878 [2025-04-26 18:39:04,428 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1863 states and 3660 transitions. [2025-04-26 18:39:04,428 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:04,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1863 states and 3660 transitions. [2025-04-26 18:39:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states and 3660 transitions. [2025-04-26 18:39:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1615. [2025-04-26 18:39:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1615 states have (on average 2.0377708978328175) internal successors, (in total 3291), 1614 states have internal predecessors, (3291), 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:39:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 3291 transitions. [2025-04-26 18:39:04,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1615 states and 3291 transitions. [2025-04-26 18:39:04,503 INFO L438 stractBuchiCegarLoop]: Abstraction has 1615 states and 3291 transitions. [2025-04-26 18:39:04,503 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:04,503 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1615 states and 3291 transitions. [2025-04-26 18:39:04,509 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 262 [2025-04-26 18:39:04,510 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:04,510 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:04,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:04,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:04,510 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:04,511 INFO L754 eck$LassoCheckResult]: Loop: "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:04,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1035232626, now seen corresponding path program 1 times [2025-04-26 18:39:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105700836] [2025-04-26 18:39:04,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:04,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:04,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:04,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105700836] [2025-04-26 18:39:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105700836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:04,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168768580] [2025-04-26 18:39:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:04,565 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:04,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 4035782, now seen corresponding path program 1 times [2025-04-26 18:39:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405945151] [2025-04-26 18:39:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:04,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:04,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:04,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:04,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:04,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:04,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:04,610 INFO L87 Difference]: Start difference. First operand 1615 states and 3291 transitions. cyclomatic complexity: 1780 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:39:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:04,665 INFO L93 Difference]: Finished difference Result 1615 states and 3290 transitions. [2025-04-26 18:39:04,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1615 states and 3290 transitions. [2025-04-26 18:39:04,675 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 262 [2025-04-26 18:39:04,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1615 states to 1615 states and 3290 transitions. [2025-04-26 18:39:04,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 630 [2025-04-26 18:39:04,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 630 [2025-04-26 18:39:04,687 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1615 states and 3290 transitions. [2025-04-26 18:39:04,687 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:04,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1615 states and 3290 transitions. [2025-04-26 18:39:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states and 3290 transitions. [2025-04-26 18:39:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-04-26 18:39:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1615 states have (on average 2.0371517027863777) internal successors, (in total 3290), 1614 states have internal predecessors, (3290), 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:39:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 3290 transitions. [2025-04-26 18:39:04,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1615 states and 3290 transitions. [2025-04-26 18:39:04,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:04,726 INFO L438 stractBuchiCegarLoop]: Abstraction has 1615 states and 3290 transitions. [2025-04-26 18:39:04,726 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:04,726 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1615 states and 3290 transitions. [2025-04-26 18:39:04,732 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 262 [2025-04-26 18:39:04,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:04,732 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:04,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:04,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:04,734 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:04,734 INFO L754 eck$LassoCheckResult]: Loop: "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 18:39:04,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1069032555, now seen corresponding path program 1 times [2025-04-26 18:39:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291985099] [2025-04-26 18:39:04,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:04,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:04,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:04,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:04,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:04,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:04,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 4035782, now seen corresponding path program 2 times [2025-04-26 18:39:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754078880] [2025-04-26 18:39:04,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:04,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:04,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:04,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:04,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1531283034, now seen corresponding path program 1 times [2025-04-26 18:39:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47312002] [2025-04-26 18:39:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:04,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:04,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:04,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:04,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:04,910 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:04,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:04,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:04,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:04,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:04,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:04,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:04,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:04,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:04,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:04,910 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:04,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:04,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:04,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:04,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:04,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:04,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:05,128 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:05,129 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,131 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:39:05,132 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:39:05,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:05,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:05,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,156 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:39:05,156 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:39:05,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:05,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:05,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,176 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,188 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:39:05,189 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:39:05,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:05,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:05,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,206 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,212 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:39:05,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,214 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:39:05,216 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:39:05,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:05,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,227 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:05,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:05,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,249 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,257 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:39:05,259 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:39:05,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:05,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:05,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:05,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:05,276 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,284 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:39:05,284 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:39:05,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:05,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:05,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:05,312 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:05,312 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:39:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,314 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:39:05,316 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:39:05,317 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:05,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,334 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:05,334 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:05,334 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 18:39:05,341 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:39:05,342 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:05,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:05,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:05,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:05,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:05,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:05,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:05,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:05,400 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:39:05,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:05,401 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1615 states and 3290 transitions. cyclomatic complexity: 1779 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:05,499 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1615 states and 3290 transitions. cyclomatic complexity: 1779. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 3460 states and 6985 transitions. Complement of second has 6 states. [2025-04-26 18:39:05,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-26 18:39:05,500 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:39:05,500 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,500 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:39:05,500 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,501 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 18:39:05,501 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3460 states and 6985 transitions. [2025-04-26 18:39:05,523 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 152 [2025-04-26 18:39:05,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3460 states to 2321 states and 4621 transitions. [2025-04-26 18:39:05,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 714 [2025-04-26 18:39:05,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 [2025-04-26 18:39:05,539 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2321 states and 4621 transitions. [2025-04-26 18:39:05,539 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:05,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2321 states and 4621 transitions. [2025-04-26 18:39:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states and 4621 transitions. [2025-04-26 18:39:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2253. [2025-04-26 18:39:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2253 states have (on average 1.9951176209498447) internal successors, (in total 4495), 2252 states have internal predecessors, (4495), 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:39:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 4495 transitions. [2025-04-26 18:39:05,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2253 states and 4495 transitions. [2025-04-26 18:39:05,580 INFO L438 stractBuchiCegarLoop]: Abstraction has 2253 states and 4495 transitions. [2025-04-26 18:39:05,580 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:05,580 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2253 states and 4495 transitions. [2025-04-26 18:39:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 152 [2025-04-26 18:39:05,589 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:05,589 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:05,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:05,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:05,590 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[102] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 18:39:05,590 INFO L754 eck$LassoCheckResult]: Loop: "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[115] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork3_k_9 1) v_thread3Thread1of1ForFork3_k_10) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_9} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 18:39:05,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1531252128, now seen corresponding path program 1 times [2025-04-26 18:39:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378085205] [2025-04-26 18:39:05,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:39:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:05,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378085205] [2025-04-26 18:39:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378085205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626283190] [2025-04-26 18:39:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:05,644 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:05,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 141072, now seen corresponding path program 1 times [2025-04-26 18:39:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496095207] [2025-04-26 18:39:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:05,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:05,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:05,665 INFO L87 Difference]: Start difference. First operand 2253 states and 4495 transitions. cyclomatic complexity: 2366 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:39:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:05,755 INFO L93 Difference]: Finished difference Result 3898 states and 7692 transitions. [2025-04-26 18:39:05,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3898 states and 7692 transitions. [2025-04-26 18:39:05,777 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 166 [2025-04-26 18:39:05,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3898 states to 3898 states and 7692 transitions. [2025-04-26 18:39:05,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1168 [2025-04-26 18:39:05,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1168 [2025-04-26 18:39:05,802 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3898 states and 7692 transitions. [2025-04-26 18:39:05,802 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:05,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3898 states and 7692 transitions. [2025-04-26 18:39:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states and 7692 transitions. [2025-04-26 18:39:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 2421. [2025-04-26 18:39:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2421 states have (on average 1.9847170590665015) internal successors, (in total 4805), 2420 states have internal predecessors, (4805), 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:39:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4805 transitions. [2025-04-26 18:39:05,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2421 states and 4805 transitions. [2025-04-26 18:39:05,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:05,850 INFO L438 stractBuchiCegarLoop]: Abstraction has 2421 states and 4805 transitions. [2025-04-26 18:39:05,851 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:05,851 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2421 states and 4805 transitions. [2025-04-26 18:39:05,859 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 152 [2025-04-26 18:39:05,859 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:05,859 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:05,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:05,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:05,860 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 18:39:05,860 INFO L754 eck$LassoCheckResult]: Loop: "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[115] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork3_k_9 1) v_thread3Thread1of1ForFork3_k_10) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_9} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 18:39:05,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1531283841, now seen corresponding path program 1 times [2025-04-26 18:39:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573613010] [2025-04-26 18:39:05,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:05,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:05,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:05,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 141072, now seen corresponding path program 2 times [2025-04-26 18:39:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013760140] [2025-04-26 18:39:05,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:05,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:05,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1629367696, now seen corresponding path program 1 times [2025-04-26 18:39:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095005064] [2025-04-26 18:39:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:05,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:05,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:05,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:06,055 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:06,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:06,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:06,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:06,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:06,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:06,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:06,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:06,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:39:06,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:06,056 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:06,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:06,215 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:06,215 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:06,217 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:39:06,218 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:39:06,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:06,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:06,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:06,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:06,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:06,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:06,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:06,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:06,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:06,237 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:39:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:06,239 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:39:06,241 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:39:06,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:06,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:06,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:06,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:06,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:06,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:06,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:06,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:06,275 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:06,276 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:06,278 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:39:06,279 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:39:06,280 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:06,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:39:06,296 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:06,297 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:06,297 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork3_k, N) = -1*thread3Thread1of1ForFork3_k + 1*N Supporting invariants [] [2025-04-26 18:39:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:06,303 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:06,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:06,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:06,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:06,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:06,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:06,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:06,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:06,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:06,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:06,366 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:39:06,366 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:06,366 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2421 states and 4805 transitions. cyclomatic complexity: 2517 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:39:06,458 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2421 states and 4805 transitions. cyclomatic complexity: 2517. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 5178 states and 10104 transitions. Complement of second has 6 states. [2025-04-26 18:39:06,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:39:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 18:39:06,461 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 18:39:06,461 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:06,461 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:06,461 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:06,461 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 18:39:06,462 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:06,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5178 states and 10104 transitions. [2025-04-26 18:39:06,495 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 72 [2025-04-26 18:39:06,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5178 states to 3087 states and 5921 transitions. [2025-04-26 18:39:06,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800 [2025-04-26 18:39:06,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 859 [2025-04-26 18:39:06,519 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3087 states and 5921 transitions. [2025-04-26 18:39:06,519 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:06,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3087 states and 5921 transitions. [2025-04-26 18:39:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states and 5921 transitions. [2025-04-26 18:39:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2999. [2025-04-26 18:39:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2999 states have (on average 1.9359786595531845) internal successors, (in total 5806), 2998 states have internal predecessors, (5806), 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:39:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5806 transitions. [2025-04-26 18:39:06,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2999 states and 5806 transitions. [2025-04-26 18:39:06,570 INFO L438 stractBuchiCegarLoop]: Abstraction has 2999 states and 5806 transitions. [2025-04-26 18:39:06,570 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:06,570 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2999 states and 5806 transitions. [2025-04-26 18:39:06,577 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 72 [2025-04-26 18:39:06,577 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:06,577 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:06,577 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] [2025-04-26 18:39:06,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:06,578 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] thread1EXIT-->L38: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:39:06,578 INFO L754 eck$LassoCheckResult]: Loop: "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:06,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1840404521, now seen corresponding path program 1 times [2025-04-26 18:39:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:06,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291771431] [2025-04-26 18:39:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:39:06,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:39:06,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:06,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:39:06,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:39:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:06,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 148980, now seen corresponding path program 1 times [2025-04-26 18:39:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:06,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068010855] [2025-04-26 18:39:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:06,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:06,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:06,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:06,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2061534814, now seen corresponding path program 1 times [2025-04-26 18:39:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:06,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82910789] [2025-04-26 18:39:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:06,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:06,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:06,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:06,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82910789] [2025-04-26 18:39:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82910789] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:39:06,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794696809] [2025-04-26 18:39:06,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:06,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:06,718 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:06,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-26 18:39:06,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:06,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:06,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:06,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:39:06,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:06,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:39:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794696809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:39:06,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:39:06,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 18:39:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656013794] [2025-04-26 18:39:06,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:39:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:06,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 18:39:06,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 18:39:06,877 INFO L87 Difference]: Start difference. First operand 2999 states and 5806 transitions. cyclomatic complexity: 2966 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (in total 34), 10 states have internal predecessors, (34), 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:39:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:06,999 INFO L93 Difference]: Finished difference Result 3242 states and 6139 transitions. [2025-04-26 18:39:06,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3242 states and 6139 transitions. [2025-04-26 18:39:07,011 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 72 [2025-04-26 18:39:07,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3242 states to 3017 states and 5830 transitions. [2025-04-26 18:39:07,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 804 [2025-04-26 18:39:07,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 804 [2025-04-26 18:39:07,030 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3017 states and 5830 transitions. [2025-04-26 18:39:07,031 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:07,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3017 states and 5830 transitions. [2025-04-26 18:39:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states and 5830 transitions. [2025-04-26 18:39:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3005. [2025-04-26 18:39:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 3005 states have (on average 1.9344425956738769) internal successors, (in total 5813), 3004 states have internal predecessors, (5813), 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:39:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 5813 transitions. [2025-04-26 18:39:07,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3005 states and 5813 transitions. [2025-04-26 18:39:07,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:39:07,079 INFO L438 stractBuchiCegarLoop]: Abstraction has 3005 states and 5813 transitions. [2025-04-26 18:39:07,079 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:07,079 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3005 states and 5813 transitions. [2025-04-26 18:39:07,085 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 72 [2025-04-26 18:39:07,085 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:07,085 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:07,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:07,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:07,087 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] thread1EXIT-->L38: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:39:07,087 INFO L754 eck$LassoCheckResult]: Loop: "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:07,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1082496606, now seen corresponding path program 2 times [2025-04-26 18:39:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45706443] [2025-04-26 18:39:07,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-26 18:39:07,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:07,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash 148980, now seen corresponding path program 2 times [2025-04-26 18:39:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449782419] [2025-04-26 18:39:07,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:07,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:07,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:07,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:07,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:07,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2042050167, now seen corresponding path program 2 times [2025-04-26 18:39:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448542819] [2025-04-26 18:39:07,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 18:39:07,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:07,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:07,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:07,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:07,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,447 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:07,448 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:07,448 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:07,448 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:07,448 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:07,448 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,448 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:07,448 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:07,448 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:39:07,448 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:07,448 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:07,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,753 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:07,753 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,755 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:39:07,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:07,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:07,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:07,781 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:39:07,781 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:07,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:39:07,785 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:07,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:07,800 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:07,800 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:07,800 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:07,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:39:07,807 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:07,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:07,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:07,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:07,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:07,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:07,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:07,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:07,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:07,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:07,871 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:39:07,871 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:07,871 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3005 states and 5813 transitions. cyclomatic complexity: 2967 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 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:39:07,919 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3005 states and 5813 transitions. cyclomatic complexity: 2967. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 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 3208 states and 6157 transitions. Complement of second has 6 states. [2025-04-26 18:39:07,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 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:39:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:39:07,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 18:39:07,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:07,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:39:07,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:07,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 23 letters. Loop has 6 letters. [2025-04-26 18:39:07,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:07,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3208 states and 6157 transitions. [2025-04-26 18:39:07,934 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:39:07,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3208 states to 1876 states and 3461 transitions. [2025-04-26 18:39:07,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2025-04-26 18:39:07,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2025-04-26 18:39:07,943 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1876 states and 3461 transitions. [2025-04-26 18:39:07,944 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:07,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1876 states and 3461 transitions. [2025-04-26 18:39:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states and 3461 transitions. [2025-04-26 18:39:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1756. [2025-04-26 18:39:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1756 states have (on average 1.902619589977221) internal successors, (in total 3341), 1755 states have internal predecessors, (3341), 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:39:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3341 transitions. [2025-04-26 18:39:07,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1756 states and 3341 transitions. [2025-04-26 18:39:07,967 INFO L438 stractBuchiCegarLoop]: Abstraction has 1756 states and 3341 transitions. [2025-04-26 18:39:07,967 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:07,967 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1756 states and 3341 transitions. [2025-04-26 18:39:07,971 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:39:07,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:07,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:07,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:07,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:07,972 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:07,972 INFO L754 eck$LassoCheckResult]: Loop: "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:07,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash -103081289, now seen corresponding path program 1 times [2025-04-26 18:39:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756063586] [2025-04-26 18:39:07,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:08,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756063586] [2025-04-26 18:39:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756063586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:39:08,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227608190] [2025-04-26 18:39:08,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:08,085 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:39:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-26 18:39:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:08,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:08,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:39:08,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:08,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:39:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227608190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:39:08,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:39:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-26 18:39:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577725045] [2025-04-26 18:39:08,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:39:08,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:08,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 147030, now seen corresponding path program 3 times [2025-04-26 18:39:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260085889] [2025-04-26 18:39:08,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:08,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:08,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:08,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 18:39:08,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-26 18:39:08,226 INFO L87 Difference]: Start difference. First operand 1756 states and 3341 transitions. cyclomatic complexity: 1678 Second operand has 10 states, 10 states have (on average 4.5) internal successors, (in total 45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:08,347 INFO L93 Difference]: Finished difference Result 3881 states and 7389 transitions. [2025-04-26 18:39:08,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3881 states and 7389 transitions. [2025-04-26 18:39:08,362 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:39:08,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3881 states to 3603 states and 6873 transitions. [2025-04-26 18:39:08,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 565 [2025-04-26 18:39:08,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 565 [2025-04-26 18:39:08,385 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3603 states and 6873 transitions. [2025-04-26 18:39:08,385 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:08,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3603 states and 6873 transitions. [2025-04-26 18:39:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states and 6873 transitions. [2025-04-26 18:39:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 2589. [2025-04-26 18:39:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2589 states have (on average 1.9127076091154886) internal successors, (in total 4952), 2588 states have internal predecessors, (4952), 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:39:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4952 transitions. [2025-04-26 18:39:08,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2589 states and 4952 transitions. [2025-04-26 18:39:08,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:39:08,424 INFO L438 stractBuchiCegarLoop]: Abstraction has 2589 states and 4952 transitions. [2025-04-26 18:39:08,424 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:39:08,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2589 states and 4952 transitions. [2025-04-26 18:39:08,430 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:39:08,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:08,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:08,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:08,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:08,432 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:08,432 INFO L754 eck$LassoCheckResult]: Loop: "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:08,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -713372654, now seen corresponding path program 2 times [2025-04-26 18:39:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74668089] [2025-04-26 18:39:08,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:39:08,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:08,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:08,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:39:08,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:08,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:08,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 147030, now seen corresponding path program 4 times [2025-04-26 18:39:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633154468] [2025-04-26 18:39:08,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,463 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 18:39:08,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:08,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:08,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -586437467, now seen corresponding path program 1 times [2025-04-26 18:39:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66472434] [2025-04-26 18:39:08,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:39:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:39:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:39:08,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:39:08,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:08,868 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:08,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:08,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:08,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:08,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:08,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:08,869 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:08,869 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:08,869 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:39:08,869 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:08,869 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:08,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:08,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,155 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:09,156 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,158 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:39:09,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,178 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:39:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,185 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:39:09,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,201 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:39:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,212 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:39:09,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,228 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:39:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,236 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:39:09,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:09,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,252 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,260 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:39:09,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:09,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,284 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:39:09,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,298 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,305 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:39:09,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,320 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:39:09,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,327 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:39:09,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:39:09,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,355 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:39:09,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:09,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:09,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:39:09,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,379 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:39:09,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 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:39:09,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:09,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:09,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:09,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:09,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:09,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:09,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:09,404 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:09,404 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:09,406 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:09,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:39:09,408 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:09,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,425 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:09,426 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:09,426 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:09,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:39:09,434 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:09,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:09,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:39:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:09,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:09,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:09,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:09,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:09,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:09,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:09,496 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:39:09,496 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:09,496 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2589 states and 4952 transitions. cyclomatic complexity: 2536 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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:39:09,541 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2589 states and 4952 transitions. cyclomatic complexity: 2536. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 4384 states and 8345 transitions. Complement of second has 6 states. [2025-04-26 18:39:09,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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:39:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-26 18:39:09,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 18:39:09,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:09,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 18:39:09,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:09,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 18:39:09,544 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:09,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4384 states and 8345 transitions. [2025-04-26 18:39:09,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:09,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4384 states to 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:09,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:09,563 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:09,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:39:09,563 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:09,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:09,563 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:09,575 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:39:09,576 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:09 BoogieIcfgContainer [2025-04-26 18:39:09,576 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:09,577 INFO L158 Benchmark]: Toolchain (without parser) took 7047.46ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 86.2MB in the beginning and 66.6MB in the end (delta: 19.5MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:09,577 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:09,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.78ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:09,577 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:09,577 INFO L158 Benchmark]: RCFGBuilder took 209.07ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:09,578 INFO L158 Benchmark]: BuchiAutomizer took 6773.99ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 73.3MB in the beginning and 66.6MB in the end (delta: 6.7MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:09,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.78ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 209.07ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6773.99ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 73.3MB in the beginning and 66.6MB in the end (delta: 6.7MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 3027 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 797 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612 IncrementalHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 350 mSDtfsCounter, 612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp184 ukn29 mio100 lsp87 div100 bol100 ite100 ukn100 eq155 hnf95 smp91 dnf143 smp77 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 3 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 562, Number of transitions in reduction automaton: 2885, Number of states in reduction automaton: 1428, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:09,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...