/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:11:58,825 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:11:58,887 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:11:58,913 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:11:58,914 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:11:58,914 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:11:58,915 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:11:58,915 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:11:58,916 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:11:58,918 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:11:58,919 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:11:58,919 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:11:58,919 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:11:58,920 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:11:58,920 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:11:58,920 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:11:58,920 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:11:58,920 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:11:58,921 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:11:58,921 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:11:58,921 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:11:58,921 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:11:58,922 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:11:58,922 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:11:58,922 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:11:58,923 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:11:58,923 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:11:58,923 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:11:58,923 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:11:58,923 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:11:58,924 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:11:58,924 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:11:58,924 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:11:58,925 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:11:58,925 INFO L137 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_AUTOMATON [2023-10-12 17:11:59,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:11:59,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:11:59,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:11:59,155 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:11:59,156 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:11:59,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl [2023-10-12 17:11:59,157 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl' [2023-10-12 17:11:59,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:11:59,179 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:11:59,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:59,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:11:59,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:11:59,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,199 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:11:59,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:59,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:11:59,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:11:59,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:11:59,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:11:59,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:11:59,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:11:59,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:11:59,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/1) ... [2023-10-12 17:11:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:11:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:11:59,247 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) [2023-10-12 17:11:59,252 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 [2023-10-12 17:11:59,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:11:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:11:59,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:11:59,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:11:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:11:59,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:11:59,293 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:11:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:11:59,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:11:59,293 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:11:59,328 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:11:59,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:11:59,396 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:11:59,400 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:11:59,401 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:11:59,402 INFO L201 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:59 BoogieIcfgContainer [2023-10-12 17:11:59,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:11:59,403 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:11:59,403 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:11:59,405 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:11:59,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:59,406 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:59" (1/2) ... [2023-10-12 17:11:59,407 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627afe35 and model type equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:11:59, skipping insertion in model container [2023-10-12 17:11:59,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:59,407 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:59" (2/2) ... [2023-10-12 17:11:59,408 INFO L332 chiAutomizerObserver]: Analyzing ICFG equal-array-sums.bpl [2023-10-12 17:11:59,446 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:11:59,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:11:59,477 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:11:59,477 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:59,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:11:59,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:11:59,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2023-10-12 17:11:59,485 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:11:59,502 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:11:59,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2023-10-12 17:11:59,507 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:11:59,507 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:59,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:11:59,508 INFO L119 LiptonReduction]: Number of co-enabled transitions 96 [2023-10-12 17:11:59,676 INFO L134 LiptonReduction]: Checked pairs total: 63 [2023-10-12 17:11:59,676 INFO L136 LiptonReduction]: Total number of compositions: 8 [2023-10-12 17:11:59,690 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,690 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,690 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,690 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,690 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,690 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,691 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,691 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:59,719 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:11:59,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,723 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:11:59,724 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,724 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:59,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:11:59,726 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:11:59,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,726 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:11:59,727 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,731 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]don't care [74] $Ultimate##0-->L21: Formula: (and (= v_x_10 0) (= v_y_10 0)) InVars {} OutVars{y=v_y_10, x=v_x_10} AuxVars[] AssignedVars[y, x] 34#[L21]don't care [64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 36#[$Ultimate##0, L21-1]don't care [50] $Ultimate##0-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 38#[L35-1, L21-1]don't care [2023-10-12 17:11:59,732 INFO L750 eck$LassoCheckResult]: Loop: 38#[L35-1, L21-1]don't care [76] L35-1-->L35-1: Formula: (and (= (+ v_x_15 (select v_A_7 v_thread1Thread1of1ForFork0_i_20)) v_x_14) (= v_thread1Thread1of1ForFork0_i_19 (+ v_thread1Thread1of1ForFork0_i_20 1)) (< v_thread1Thread1of1ForFork0_i_20 v_n_13)) InVars {A=v_A_7, n=v_n_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_20, x=v_x_15} OutVars{A=v_A_7, n=v_n_13, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_19, x=v_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i, x] 38#[L35-1, L21-1]don't care [2023-10-12 17:11:59,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash 102939, now seen corresponding path program 1 times [2023-10-12 17:11:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528973487] [2023-10-12 17:11:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2023-10-12 17:11:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947161601] [2023-10-12 17:11:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash 3191185, now seen corresponding path program 1 times [2023-10-12 17:11:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547094301] [2023-10-12 17:11:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,996 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:11:59,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:11:59,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:11:59,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:11:59,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:11:59,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:11:59,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:11:59,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:11:59,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:11:59,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:11:59,998 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:00,008 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,016 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,019 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,080 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:00,083 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,093 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) [2023-10-12 17:12:00,094 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 [2023-10-12 17:12:00,098 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 [2023-10-12 17:12:00,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:00,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:00,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:00,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:00,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:00,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:00,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:00,129 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 [2023-10-12 17:12:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,131 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) [2023-10-12 17:12:00,133 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 [2023-10-12 17:12:00,135 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 [2023-10-12 17:12:00,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:00,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:00,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:00,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:00,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:00,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:00,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:00,190 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 [2023-10-12 17:12:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,192 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) [2023-10-12 17:12:00,194 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 [2023-10-12 17:12:00,200 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 [2023-10-12 17:12:00,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:00,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:00,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:00,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:00,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:00,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:00,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:00,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,237 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) [2023-10-12 17:12:00,241 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 [2023-10-12 17:12:00,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:00,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:00,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:00,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:00,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:00,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:00,262 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 [2023-10-12 17:12:00,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:00,278 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:12:00,278 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:00,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,289 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) [2023-10-12 17:12:00,291 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 [2023-10-12 17:12:00,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:00,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:00,329 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:00,329 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, n) = -1*thread1Thread1of1ForFork0_i + 1*n Supporting invariants [] [2023-10-12 17:12:00,332 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 [2023-10-12 17:12:00,335 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:00,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:00,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:00,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:00,419 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:00,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:00,463 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:00,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:12:00,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 45 states and 101 transitions. Complement of second has 4 states. [2023-10-12 17:12:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:12:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:12:00,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:00,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 101 transitions. [2023-10-12 17:12:00,542 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:00,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 23 states and 53 transitions. [2023-10-12 17:12:00,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-10-12 17:12:00,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:12:00,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 53 transitions. [2023-10-12 17:12:00,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:00,563 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2023-10-12 17:12:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 53 transitions. [2023-10-12 17:12:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:12:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 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) [2023-10-12 17:12:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2023-10-12 17:12:00,600 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:12:00,600 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:12:00,600 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:00,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2023-10-12 17:12:00,601 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:00,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:00,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:00,601 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:00,601 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:00,602 INFO L748 eck$LassoCheckResult]: Stem: 169#[$Ultimate##0]don't care [74] $Ultimate##0-->L21: Formula: (and (= v_x_10 0) (= v_y_10 0)) InVars {} OutVars{y=v_y_10, x=v_x_10} AuxVars[] AssignedVars[y, x] 163#[L21]don't care [64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 157#[$Ultimate##0, L21-1]don't care [67] L21-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 161#[$Ultimate##0, L22, $Ultimate##0]don't care [56] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 165#[$Ultimate##0, L22, L47-1]don't care [2023-10-12 17:12:00,602 INFO L750 eck$LassoCheckResult]: Loop: 165#[$Ultimate##0, L22, L47-1]don't care [77] L47-1-->L47-1: Formula: (and (= v_y_14 (+ (select v_A_9 v_thread2Thread1of1ForFork1_j_20) v_y_15)) (= v_thread2Thread1of1ForFork1_j_19 (+ v_thread2Thread1of1ForFork1_j_20 1)) (< v_thread2Thread1of1ForFork1_j_20 v_n_15)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, A=v_A_9, n=v_n_15, y=v_y_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_19, A=v_A_9, n=v_n_15, y=v_y_14} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, y] 165#[$Ultimate##0, L22, L47-1]don't care [2023-10-12 17:12:00,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 3191692, now seen corresponding path program 1 times [2023-10-12 17:12:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601871889] [2023-10-12 17:12:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:00,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2023-10-12 17:12:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400106193] [2023-10-12 17:12:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:00,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 98942529, now seen corresponding path program 1 times [2023-10-12 17:12:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604914604] [2023-10-12 17:12:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:00,693 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:00,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:00,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:00,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:00,694 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:00,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:00,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:00,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:00,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:00,694 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:00,696 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,709 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,711 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,713 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,716 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:00,781 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:00,781 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:00,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,810 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) [2023-10-12 17:12:00,812 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 [2023-10-12 17:12:00,813 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 [2023-10-12 17:12:00,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:00,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:00,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:00,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:00,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:00,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:00,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:00,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:00,847 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:00,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:00,921 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) [2023-10-12 17:12:00,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:00,935 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 [2023-10-12 17:12:00,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:00,937 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:00,937 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, n) = -1*thread2Thread1of1ForFork1_j + 1*n Supporting invariants [] [2023-10-12 17:12:00,942 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 [2023-10-12 17:12:00,943 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:00,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:00,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:00,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:00,971 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:00,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:00,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:00,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-10-12 17:12:00,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 36 states and 81 transitions. Complement of second has 4 states. [2023-10-12 17:12:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-10-12 17:12:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2023-10-12 17:12:00,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:00,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:00,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:00,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:00,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 81 transitions. [2023-10-12 17:12:00,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:00,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:00,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:00,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:00,990 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:00,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:00,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:00,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:00,995 INFO L201 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:00 BoogieIcfgContainer [2023-10-12 17:12:00,995 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:00,995 INFO L158 Benchmark]: Toolchain (without parser) took 1816.15ms. Allocated memory was 208.7MB in the beginning and 261.1MB in the end (delta: 52.4MB). Free memory was 158.4MB in the beginning and 174.1MB in the end (delta: -15.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,996 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 208.7MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:00,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.74ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,996 INFO L158 Benchmark]: Boogie Preprocessor took 14.34ms. Allocated memory is still 208.7MB. Free memory was 156.8MB in the beginning and 155.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,997 INFO L158 Benchmark]: RCFGBuilder took 185.98ms. Allocated memory is still 208.7MB. Free memory was 155.6MB in the beginning and 173.2MB in the end (delta: -17.6MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,997 INFO L158 Benchmark]: BuchiAutomizer took 1592.07ms. Allocated memory was 208.7MB in the beginning and 261.1MB in the end (delta: 52.4MB). Free memory was 173.2MB in the beginning and 174.1MB in the end (delta: -907.0kB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,998 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.26ms. Allocated memory is still 208.7MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.74ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.34ms. Allocated memory is still 208.7MB. Free memory was 156.8MB in the beginning and 155.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 185.98ms. Allocated memory is still 208.7MB. Free memory was 155.6MB in the beginning and 173.2MB in the end (delta: -17.6MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 1592.07ms. Allocated memory was 208.7MB in the beginning and 261.1MB in the end (delta: 52.4MB). Free memory was 173.2MB in the beginning and 174.1MB in the end (delta: -907.0kB). Peak memory consumption was 50.4MB. 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 -1 * i + n and consists of 3 locations. One deterministic module has affine ranking function n + -1 * j and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp72 ukn91 mio100 lsp57 div100 bol100 ite100 ukn100 eq183 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 18 PlacesAfterwards, 21 TransitionsBefore, 13 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:12:01,024 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 [2023-10-12 17:12:01,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:12:01,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...