/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:32:28,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:32:28,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:32:28,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:32:28,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:32:28,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:32:28,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:32:28,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:32:28,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:32:28,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:32:28,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:32:28,649 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:32:28,649 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:32:28,649 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:32:28,650 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:32:28,650 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:32:28,650 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:32:28,650 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:32:28,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:32:28,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:32:28,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:32:28,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:32:28,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:32:28,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:32:28,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:32:28,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:32:28,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:32:28,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:32:28,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:32:28,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:32:28,656 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:32:28,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:32:28,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:32:28,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:32:28,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:32:28,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:32:28,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:32:28,657 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:32:28,658 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:32:28,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:32:28,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:32:28,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:32:28,923 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:32:28,924 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:32:28,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl [2024-02-10 01:32:28,925 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl' [2024-02-10 01:32:28,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:32:28,960 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:32:28,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:28,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:32:28,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:32:28,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:28,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,005 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 20 [2024-02-10 01:32:29,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:29,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:32:29,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:32:29,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:32:29,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:32:29,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:32:29,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:32:29,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:32:29,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/1) ... [2024-02-10 01:32:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:29,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:29,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:32:29,147 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 01:32:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:32:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:32:29,148 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 01:32:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:32:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:32:29,148 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:32:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:32:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:32:29,149 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:32:29,193 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:32:29,196 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:32:29,313 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:32:29,322 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:32:29,322 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:32:29,324 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:29 BoogieIcfgContainer [2024-02-10 01:32:29,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:32:29,325 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:32:29,325 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:32:29,331 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:32:29,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:29,332 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:28" (1/2) ... [2024-02-10 01:32:29,333 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d8d5c88 and model type equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:32:29, skipping insertion in model container [2024-02-10 01:32:29,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:29,333 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:29" (2/2) ... [2024-02-10 01:32:29,335 INFO L332 chiAutomizerObserver]: Analyzing ICFG equal-array-sums-locked.bpl [2024-02-10 01:32:29,377 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:32:29,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-02-10 01:32:29,416 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-02-10 01:32:29,416 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:32:29,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2024-02-10 01:32:29,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-02-10 01:32:29,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2024-02-10 01:32:29,427 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:32:29,428 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:32:29,428 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:32:29,428 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:32:29,428 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:32:29,428 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:32:29,428 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:32:29,428 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:32:29,428 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:29,429 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 30 places, 25 transitions, 62 flow [2024-02-10 01:32:29,443 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 87 states, 85 states have (on average 1.964705882352941) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:29,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 87 states, 85 states have (on average 1.964705882352941) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:29,461 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2024-02-10 01:32:29,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:29,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:29,465 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:32:29,465 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:29,465 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 30 places, 25 transitions, 62 flow [2024-02-10 01:32:29,473 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 87 states, 85 states have (on average 1.964705882352941) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:29,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 87 states, 85 states have (on average 1.964705882352941) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:29,478 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2024-02-10 01:32:29,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:29,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:29,483 INFO L748 eck$LassoCheckResult]: Stem: Black: 211#[$Ultimate##0]don't care [64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 214#[L24]don't care [51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 216#[L26]don't care [84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0] 218#[$Ultimate##0, L26-1]don't care [66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1] 222#[L40-1, L26-1]don't care [2024-02-10 01:32:29,486 INFO L750 eck$LassoCheckResult]: Loop: 222#[L40-1, L26-1]don't care [68] L40-1-->L65: Formula: (< |v_thread1Thread1of1ForFork0_i#1_5| v_n_1) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} AuxVars[] AssignedVars[] 230#[L65, L26-1]don't care [70] L65-->L65-2: Formula: (and v_m_11 (not v_m_12)) InVars {m=v_m_12} OutVars{m=v_m_11} AuxVars[] AssignedVars[m] 244#[L26-1, L65-2]don't care [71] L65-2-->L71: Formula: (= v_x_1 (+ (select v_A_1 |v_thread1Thread1of1ForFork0_i#1_7|) v_x_2)) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[x] 262#[L71, L26-1]don't care [72] L71-->L68: Formula: (not v_m_3) InVars {} OutVars{m=v_m_3} AuxVars[] AssignedVars[m] 286#[L68, L26-1]don't care [73] L68-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_10| (+ |v_thread1Thread1of1ForFork0_i#1_9| 1)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_9|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1] 222#[L40-1, L26-1]don't care [2024-02-10 01:32:29,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2881826, now seen corresponding path program 1 times [2024-02-10 01:32:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774831811] [2024-02-10 01:32:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:29,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash 93584485, now seen corresponding path program 1 times [2024-02-10 01:32:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47894636] [2024-02-10 01:32:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:29,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2025091100, now seen corresponding path program 1 times [2024-02-10 01:32:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635706904] [2024-02-10 01:32:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:29,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:29,745 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:29,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:29,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:29,747 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:29,747 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:29,747 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:29,747 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:29,747 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:29,747 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:32:29,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:29,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:29,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:29,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:29,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:29,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:29,872 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:29,875 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:29,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:29,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:29,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:29,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:32:29,884 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 [2024-02-10 01:32:29,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:29,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:29,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:29,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:29,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:29,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:29,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:29,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:29,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:29,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:29,935 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 [2024-02-10 01:32:29,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:29,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:29,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:29,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:29,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:29,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:29,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:32:29,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:29,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:29,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:29,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:29,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:29,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:32:29,983 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 [2024-02-10 01:32:29,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:29,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:29,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:29,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:29,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:29,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:30,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:30,034 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:32:30,034 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:32:30,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:30,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:32:30,071 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:32:30,071 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:30,071 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread1Thread1of1ForFork0_i#1) = 1*n - 1*thread1Thread1of1ForFork0_i#1 Supporting invariants [] [2024-02-10 01:32:30,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:32:30,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:32:30,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:30,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:30,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:30,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:32:30,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:30,227 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 [2024-02-10 01:32:30,228 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,354 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 361 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:30,354 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:30,355 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:30,360 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:30,360 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-02-10 01:32:30,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 4 letters. Loop has 5 letters. [2024-02-10 01:32:30,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:30,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 9 letters. Loop has 5 letters. [2024-02-10 01:32:30,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:30,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 4 letters. Loop has 10 letters. [2024-02-10 01:32:30,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:30,368 INFO L428 stractBuchiCegarLoop]: Abstraction has has 48 places, 618 transitions, 2754 flow [2024-02-10 01:32:30,369 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:32:30,369 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:30,369 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 48 places, 618 transitions, 2754 flow [2024-02-10 01:32:30,407 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 261 states, 251 states have (on average 2.5737051792828685) internal successors, (646), 260 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 261 states, 251 states have (on average 2.5737051792828685) internal successors, (646), 260 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:30,419 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 90 [2024-02-10 01:32:30,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:30,421 INFO L748 eck$LassoCheckResult]: Stem: Black: 447#[$Ultimate##0]don't care [64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] Black: 450#[L24]don't care [51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] Black: 455#[L26]don't care [84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0] Black: 463#[L26-1, $Ultimate##0]don't care [87] L26-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_14|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] Black: 471#[$Ultimate##0, $Ultimate##0, L27]don't care [74] $Ultimate##0-->L54-1: Formula: (= |v_thread2Thread1of1ForFork1_j#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1] 488#[$Ultimate##0, L27, L54-1]don't care [2024-02-10 01:32:30,421 INFO L750 eck$LassoCheckResult]: Loop: 488#[$Ultimate##0, L27, L54-1]don't care [76] L54-1-->L65: Formula: (< |v_thread2Thread1of1ForFork1_j#1_5| v_n_3) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} AuxVars[] AssignedVars[] Black: 539#[$Ultimate##0, L27, L65]don't care [78] L65-->L65-2: Formula: (and (not v_m_8) v_m_7) InVars {m=v_m_8} OutVars{m=v_m_7} AuxVars[] AssignedVars[m] 632#[$Ultimate##0, L65-2, L27]don't care [79] L65-2-->L71: Formula: (= (+ v_y_2 (select v_A_2 |v_thread2Thread1of1ForFork1_j#1_7|)) v_y_1) InVars {A=v_A_2, y=v_y_2, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} OutVars{A=v_A_2, y=v_y_1, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} AuxVars[] AssignedVars[y] Black: 736#[$Ultimate##0, L27, L71]don't care [80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m] 849#[$Ultimate##0, L27, L68]don't care [81] L68-->L54-1: Formula: (= (+ |v_thread2Thread1of1ForFork1_j#1_9| 1) |v_thread2Thread1of1ForFork1_j#1_10|) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_9|} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1] Black: 490#[$Ultimate##0, L27, L54-1]don't care [76] L54-1-->L65: Formula: (< |v_thread2Thread1of1ForFork1_j#1_5| v_n_3) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} AuxVars[] AssignedVars[] 534#[$Ultimate##0, L27, L65]don't care [78] L65-->L65-2: Formula: (and (not v_m_8) v_m_7) InVars {m=v_m_8} OutVars{m=v_m_7} AuxVars[] AssignedVars[m] Black: 634#[$Ultimate##0, L65-2, L27]don't care [79] L65-2-->L71: Formula: (= (+ v_y_2 (select v_A_2 |v_thread2Thread1of1ForFork1_j#1_7|)) v_y_1) InVars {A=v_A_2, y=v_y_2, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} OutVars{A=v_A_2, y=v_y_1, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} AuxVars[] AssignedVars[y] 734#[$Ultimate##0, L27, L71]don't care [80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m] Black: 851#[$Ultimate##0, L27, L68]don't care [81] L68-->L54-1: Formula: (= (+ |v_thread2Thread1of1ForFork1_j#1_9| 1) |v_thread2Thread1of1ForFork1_j#1_10|) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_9|} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1] 488#[$Ultimate##0, L27, L54-1]don't care [2024-02-10 01:32:30,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 89337331, now seen corresponding path program 1 times [2024-02-10 01:32:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:30,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711389647] [2024-02-10 01:32:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:30,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1820828545, now seen corresponding path program 1 times [2024-02-10 01:32:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:30,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097428266] [2024-02-10 01:32:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:30,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 431459059, now seen corresponding path program 1 times [2024-02-10 01:32:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179891196] [2024-02-10 01:32:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:30,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:30,586 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:30,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:30,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:30,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:30,587 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:30,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:30,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:30,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:32:30,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:30,587 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:30,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:30,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:30,690 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,696 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 [2024-02-10 01:32:30,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:32:30,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:30,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:30,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:30,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:30,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:30,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:30,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:30,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:30,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:30,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:32:30,785 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 [2024-02-10 01:32:30,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:30,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:30,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:30,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:30,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:30,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:30,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:30,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:30,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,821 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,826 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 [2024-02-10 01:32:30,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:30,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:30,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:30,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:30,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:30,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:30,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:32:30,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:30,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,850 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,852 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 [2024-02-10 01:32:30,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:30,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:30,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:30,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:30,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:30,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:30,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:32:30,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:30,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:30,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:30,885 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 [2024-02-10 01:32:30,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:30,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:30,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:30,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:30,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:30,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:30,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:32:30,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:30,919 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:32:30,920 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:32:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:30,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:31,021 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:32:31,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:32:31,023 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:31,033 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:32:31,033 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:31,033 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread2Thread1of1ForFork1_j#1) = 1*n - 1*thread2Thread1of1ForFork1_j#1 Supporting invariants [] [2024-02-10 01:32:31,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:32:31,043 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:32:31,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:31,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:31,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:31,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:32:31,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:31,144 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:32:31,145 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:31,240 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 334 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:31,240 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:31,240 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:31,308 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:31,308 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-02-10 01:32:31,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 5 letters. Loop has 10 letters. [2024-02-10 01:32:31,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:31,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 15 letters. Loop has 10 letters. [2024-02-10 01:32:31,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:31,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 5 letters. Loop has 20 letters. [2024-02-10 01:32:31,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:31,311 INFO L428 stractBuchiCegarLoop]: Abstraction has has 64 places, 14104 transitions, 90612 flow [2024-02-10 01:32:31,311 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:32:31,311 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:31,312 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 64 places, 14104 transitions, 90612 flow [2024-02-10 01:32:31,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:32:32,139 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 958 states, 889 states have (on average 3.420697412823397) internal successors, (3041), 957 states have internal predecessors, (3041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:32,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 958 states, 889 states have (on average 3.420697412823397) internal successors, (3041), 957 states have internal predecessors, (3041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:32:32,176 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:32:32,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:32:32,189 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:32:32 BoogieIcfgContainer [2024-02-10 01:32:32,189 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:32:32,189 INFO L158 Benchmark]: Toolchain (without parser) took 3229.72ms. Allocated memory was 173.0MB in the beginning and 241.2MB in the end (delta: 68.2MB). Free memory was 119.4MB in the beginning and 113.6MB in the end (delta: 5.8MB). Peak memory consumption was 104.3MB. Max. memory is 8.0GB. [2024-02-10 01:32:32,190 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:32:32,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.15ms. Allocated memory is still 173.0MB. Free memory was 119.4MB in the beginning and 117.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:32:32,190 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 173.0MB. Free memory was 117.4MB in the beginning and 153.8MB in the end (delta: -36.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2024-02-10 01:32:32,191 INFO L158 Benchmark]: RCFGBuilder took 267.34ms. Allocated memory is still 173.0MB. Free memory was 153.8MB in the beginning and 144.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:32:32,191 INFO L158 Benchmark]: BuchiAutomizer took 2864.00ms. Allocated memory was 173.0MB in the beginning and 241.2MB in the end (delta: 68.2MB). Free memory was 143.8MB in the beginning and 113.6MB in the end (delta: 30.3MB). Peak memory consumption was 129.1MB. Max. memory is 8.0GB. [2024-02-10 01:32:32,193 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.11ms. Allocated memory is still 173.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.15ms. Allocated memory is still 173.0MB. Free memory was 119.4MB in the beginning and 117.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 173.0MB. Free memory was 117.4MB in the beginning and 153.8MB in the end (delta: -36.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * RCFGBuilder took 267.34ms. Allocated memory is still 173.0MB. Free memory was 153.8MB in the beginning and 144.1MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2864.00ms. Allocated memory was 173.0MB in the beginning and 241.2MB in the end (delta: 68.2MB). Free memory was 143.8MB in the beginning and 113.6MB in the end (delta: 30.3MB). Peak memory consumption was 129.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/5 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 114 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital39 mio100 ax100 hnf100 lsp67 ukn85 mio100 lsp57 div100 bol100 ite100 ukn100 eq177 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:32:32,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...