/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 true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -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 00:57:16,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:57:16,542 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 00:57:16,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:57:16,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:57:16,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:57:16,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:57:16,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:57:16,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:57:16,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:57:16,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:57:16,629 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:57:16,629 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:57:16,629 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:57:16,630 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:57:16,630 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:57:16,630 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:57:16,630 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:57:16,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:57:16,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:57:16,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:57:16,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:57:16,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:57:16,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:57:16,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:57:16,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:57:16,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:57:16,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:57:16,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:57:16,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:57:16,649 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:57:16,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:57:16,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:57:16,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:57:16,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:57:16,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:57:16,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:57:16,671 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:57:16,672 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:57:17,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:57:17,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:57:17,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:57:17,194 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:57:17,196 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:57:17,197 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 00:57:17,198 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl' [2024-02-10 00:57:17,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:57:17,347 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:57:17,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:17,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:57:17,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:57:17,365 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,377 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,407 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 20 [2024-02-10 00:57:17,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:17,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:57:17,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:57:17,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:57:17,418 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,419 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,420 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,420 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,423 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,426 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,443 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,445 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:57:17,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:57:17,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:57:17,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:57:17,448 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 12:57:17" (1/1) ... [2024-02-10 00:57:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:17,490 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 00:57:17,496 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 00:57:17,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-02-10 00:57:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:57:17,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:57:17,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-02-10 00:57:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:57:17,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:57:17,536 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:57:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:57:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:57:17,537 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 00:57:17,580 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:57:17,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:57:17,671 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:57:17,683 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:57:17,684 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:57:17,686 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:57:17 BoogieIcfgContainer [2024-02-10 00:57:17,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:57:17,687 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:57:17,687 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:57:17,690 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:57:17,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:17,691 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 12:57:17" (1/2) ... [2024-02-10 00:57:17,692 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e26d576 and model type equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:57:17, skipping insertion in model container [2024-02-10 00:57:17,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:17,692 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 12:57:17" (2/2) ... [2024-02-10 00:57:17,694 INFO L332 chiAutomizerObserver]: Analyzing ICFG equal-array-sums-locked.bpl [2024-02-10 00:57:17,740 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:57:17,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-02-10 00:57:17,784 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-02-10 00:57:17,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:17,788 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 00:57:17,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-02-10 00:57:17,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2024-02-10 00:57:17,801 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:57:17,801 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:57:17,801 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:57:17,801 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:57:17,802 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:57:17,802 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:57:17,802 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:57:17,802 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:57:17,803 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 25 transitions, 62 flow [2024-02-10 00:57:17,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:17,810 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 00:57:17,810 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:17,810 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:17,818 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:57:17,818 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 25 transitions, 62 flow [2024-02-10 00:57:17,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:17,828 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 00:57:17,828 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:17,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:17,833 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 38#[L24]true [51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 40#[L26]true [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] 42#[L26-1, $Ultimate##0]true [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] 44#[L26-1, L40-1]true [2024-02-10 00:57:17,834 INFO L750 eck$LassoCheckResult]: Loop: 44#[L26-1, L40-1]true [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[] 47#[L65, L26-1]true [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] 49#[L26-1, L65-2]true [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] 51#[L71, L26-1]true [72] L71-->L68: Formula: (not v_m_3) InVars {} OutVars{m=v_m_3} AuxVars[] AssignedVars[m] 53#[L68, L26-1]true [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] 44#[L26-1, L40-1]true [2024-02-10 00:57:17,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2881826, now seen corresponding path program 1 times [2024-02-10 00:57:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392750999] [2024-02-10 00:57:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:17,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:17,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 93584485, now seen corresponding path program 1 times [2024-02-10 00:57:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160167277] [2024-02-10 00:57:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:17,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2025091100, now seen corresponding path program 1 times [2024-02-10 00:57:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:17,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226403309] [2024-02-10 00:57:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:17,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:18,116 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:18,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:18,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:18,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:18,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:18,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:18,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:18,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:18,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:57:18,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:18,118 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:18,130 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 00:57:18,157 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 00:57:18,176 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 00:57:18,179 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 00:57:18,253 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:57:18,256 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:57:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:18,289 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 00:57:18,345 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 00:57:18,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:57:18,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:18,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:18,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:18,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:18,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:18,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:18,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:18,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:18,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:57:18,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:18,379 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 00:57:18,381 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 00:57:18,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:57:18,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:18,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:18,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:18,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:18,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:18,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:18,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:18,430 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 00:57:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:18,432 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 00:57:18,440 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 00:57:18,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:18,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:18,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:18,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:18,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:18,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:18,457 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 00:57:18,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:57:18,471 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:57:18,471 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:57:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:18,478 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 00:57:18,480 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 00:57:18,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:57:18,490 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:57:18,490 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:57:18,491 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 00:57:18,503 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 00:57:18,508 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:57:18,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:18,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:57:18,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:18,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:57:18,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:18,635 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 00:57:18,674 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 00:57:18,676 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 00:57:18,812 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 00:57:18,813 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:57:18,813 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:57:18,814 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:57:18,849 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:57:18,850 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:57:18,853 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 00:57:18,858 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 00:57:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-02-10 00:57:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 4 letters. Loop has 5 letters. [2024-02-10 00:57:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 9 letters. Loop has 5 letters. [2024-02-10 00:57:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 4 letters. Loop has 10 letters. [2024-02-10 00:57:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:18,872 INFO L428 stractBuchiCegarLoop]: Abstraction has has 39 places, 309 transitions, 1377 flow [2024-02-10 00:57:18,872 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:57:18,872 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 309 transitions, 1377 flow [2024-02-10 00:57:18,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:18,939 INFO L124 PetriNetUnfolderBase]: 208/314 cut-off events. [2024-02-10 00:57:18,943 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-02-10 00:57:18,943 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:18,944 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 38#[L24]true [51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y] 40#[L26]true [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] 42#[L26-1, $Ultimate##0]true [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] 123#[L27, $Ultimate##0, $Ultimate##0]true [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] 125#[L27, $Ultimate##0, L54-1]true [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[] 127#[L27, $Ultimate##0, L65]true [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] 129#[L27, $Ultimate##0, L65-2]true [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] 131#[L27, $Ultimate##0, L71]true [80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m] 133#[L68, L27, $Ultimate##0]true [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] 125#[L27, $Ultimate##0, L54-1]true [2024-02-10 00:57:18,945 INFO L750 eck$LassoCheckResult]: Loop: 125#[L27, $Ultimate##0, L54-1]true [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[] 127#[L27, $Ultimate##0, L65]true [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] 129#[L27, $Ultimate##0, L65-2]true [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] 131#[L27, $Ultimate##0, L71]true [80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m] 133#[L68, L27, $Ultimate##0]true [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] 125#[L27, $Ultimate##0, L54-1]true [2024-02-10 00:57:18,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1013042245, now seen corresponding path program 1 times [2024-02-10 00:57:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550859740] [2024-02-10 00:57:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:18,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:18,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:18,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 101218925, now seen corresponding path program 1 times [2024-02-10 00:57:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951925307] [2024-02-10 00:57:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:18,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:18,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:18,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash 431459059, now seen corresponding path program 2 times [2024-02-10 00:57:18,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102358065] [2024-02-10 00:57:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:19,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:19,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:19,129 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:19,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:19,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:19,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:19,130 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:19,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:19,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:19,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:57:19,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:19,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:19,132 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 00:57:19,135 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 00:57:19,141 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 00:57:19,147 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 00:57:19,149 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 00:57:19,167 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 00:57:19,170 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 00:57:19,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:57:19,241 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:57:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,257 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 00:57:19,258 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 00:57:19,265 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 00:57:19,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:19,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:19,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:19,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:19,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:19,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:19,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:19,294 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 00:57:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,296 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 00:57:19,299 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 00:57:19,299 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 00:57:19,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:19,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:19,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:19,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:19,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:19,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:19,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:19,330 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 00:57:19,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,349 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 00:57:19,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 [2024-02-10 00:57:19,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:19,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:19,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:19,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:19,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:19,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:19,396 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 00:57:19,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:19,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 00:57:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,450 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 00:57:19,451 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 00:57:19,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:57:19,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:19,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:19,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:19,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:19,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:19,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:19,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:19,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:19,506 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 00:57:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,508 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 00:57:19,514 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 00:57:19,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:19,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:19,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:19,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:19,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:19,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:19,531 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 00:57:19,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:57:19,543 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 00:57:19,543 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 00:57:19,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:19,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:19,547 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 00:57:19,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:57:19,559 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 00:57:19,569 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:57:19,569 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:57:19,569 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 00:57:19,584 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 00:57:19,586 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:57:19,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:19,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:57:19,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:19,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:57:19,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:19,692 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 00:57:19,693 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 00:57:19,693 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 00:57:19,826 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 9 states and 361 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:57:19,826 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:57:19,826 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:57:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 361 transitions. [2024-02-10 00:57:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 361 transitions. [2024-02-10 00:57:19,846 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:57:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 361 transitions. [2024-02-10 00:57:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 361 transitions. [2024-02-10 00:57:19,942 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 00:57:20,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 00:57:20,100 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:57:20,100 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:57:20,100 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 00:57:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 00:57:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-02-10 00:57:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 10 letters. Loop has 5 letters. [2024-02-10 00:57:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 15 letters. Loop has 5 letters. [2024-02-10 00:57:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:20,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 10 letters. Loop has 10 letters. [2024-02-10 00:57:20,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:20,103 INFO L428 stractBuchiCegarLoop]: Abstraction has has 52 places, 4954 transitions, 31848 flow [2024-02-10 00:57:20,104 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:57:20,104 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 4954 transitions, 31848 flow [2024-02-10 00:57:20,829 INFO L124 PetriNetUnfolderBase]: 2155/2952 cut-off events. [2024-02-10 00:57:20,829 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-02-10 00:57:20,829 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:57:20,838 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:57:20 BoogieIcfgContainer [2024-02-10 00:57:20,838 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:57:20,842 INFO L158 Benchmark]: Toolchain (without parser) took 3491.09ms. Allocated memory was 159.4MB in the beginning and 284.2MB in the end (delta: 124.8MB). Free memory was 123.7MB in the beginning and 169.3MB in the end (delta: -45.5MB). Peak memory consumption was 171.7MB. Max. memory is 8.0GB. [2024-02-10 00:57:20,843 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:57:20,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.55ms. Allocated memory was 159.4MB in the beginning and 284.2MB in the end (delta: 124.8MB). Free memory was 123.7MB in the beginning and 258.2MB in the end (delta: -134.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:57:20,844 INFO L158 Benchmark]: Boogie Preprocessor took 35.42ms. Allocated memory is still 284.2MB. Free memory was 258.2MB in the beginning and 257.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:57:20,844 INFO L158 Benchmark]: RCFGBuilder took 238.96ms. Allocated memory is still 284.2MB. Free memory was 257.1MB in the beginning and 245.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:57:20,844 INFO L158 Benchmark]: BuchiAutomizer took 3151.17ms. Allocated memory is still 284.2MB. Free memory was 245.6MB in the beginning and 169.3MB in the end (delta: 76.3MB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. [2024-02-10 00:57:20,848 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.13ms. Allocated memory is still 159.4MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.55ms. Allocated memory was 159.4MB in the beginning and 284.2MB in the end (delta: 124.8MB). Free memory was 123.7MB in the beginning and 258.2MB in the end (delta: -134.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.42ms. Allocated memory is still 284.2MB. Free memory was 258.2MB in the beginning and 257.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.96ms. Allocated memory is still 284.2MB. Free memory was 257.1MB in the beginning and 245.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3151.17ms. Allocated memory is still 284.2MB. Free memory was 245.6MB in the beginning and 169.3MB in the end (delta: 76.3MB). Peak memory consumption was 170.2MB. 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 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 114 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital42 mio100 ax100 hnf100 lsp65 ukn89 mio100 lsp65 div100 bol100 ite100 ukn100 eq163 hnf94 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 00:57:20,870 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...