/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:28:38,631 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:28:38,670 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:28:38,683 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:28:38,683 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:28:38,684 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:28:38,685 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:28:38,685 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:28:38,685 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:28:38,685 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:28:38,686 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:28:38,686 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:28:38,686 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:28:38,686 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:28:38,687 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:28:38,687 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:28:38,687 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:28:38,687 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:28:38,688 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:28:38,688 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:28:38,688 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:28:38,689 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:28:38,689 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:28:38,689 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:28:38,689 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:28:38,689 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:28:38,690 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:28:38,690 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:28:38,690 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:28:38,690 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:28:38,691 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:28:38,691 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:28:38,691 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:28:38,692 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:28:38,692 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_PETRI_NET [2023-10-12 17:28:38,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:28:38,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:28:38,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:28:38,894 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:28:38,894 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:28:38,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl [2023-10-12 17:28:38,896 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl' [2023-10-12 17:28:38,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:28:38,920 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:28:38,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:28:38,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:28:38,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:28:38,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,942 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:28:38,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:28:38,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:28:38,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:28:38,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:28:38,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:28:38,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:28:38,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:28:38,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:28:38,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/1) ... [2023-10-12 17:28:38,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:38,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:38,989 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:28:38,994 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:28:39,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:28:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:28:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:28:39,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:28:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:28:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:28:39,022 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:28:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:28:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:28:39,022 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:28:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:28:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:28:39,023 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:28:39,059 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:28:39,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:28:39,166 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:28:39,177 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:28:39,178 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:28:39,179 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:28:39 BoogieIcfgContainer [2023-10-12 17:28:39,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:28:39,180 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:28:39,180 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:28:39,183 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:28:39,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:28:39,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:28:38" (1/2) ... [2023-10-12 17:28:39,184 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@232c1747 and model type max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:28:39, skipping insertion in model container [2023-10-12 17:28:39,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:28:39,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:28:39" (2/2) ... [2023-10-12 17:28:39,185 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-array.wvr.bpl [2023-10-12 17:28:39,226 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:28:39,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:28:39,259 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:28:39,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:28:39,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:28:39,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:28:39,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:28:39,269 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:28:39,278 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:28:39,280 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:28:39,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:28:39,286 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:28:39,286 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:28:39,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:28:39,287 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:28:39,478 INFO L134 LiptonReduction]: Checked pairs total: 106 [2023-10-12 17:28:39,478 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:28:39,487 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:28:39,487 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:28:39,488 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:28:39,488 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:28:39,488 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:28:39,488 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:28:39,488 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:28:39,488 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:28:39,489 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:28:39,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:39,493 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:28:39,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:28:39,493 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:39,495 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:28:39,495 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:28:39,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:39,496 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:28:39,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:28:39,496 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:39,500 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [2023-10-12 17:28:39,500 INFO L750 eck$LassoCheckResult]: Loop: 44#[L22-1, L58-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 44#[L22-1, L58-1]true [2023-10-12 17:28:39,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:28:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84179706] [2023-10-12 17:28:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:39,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:28:39,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135925206] [2023-10-12 17:28:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:39,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 130423, now seen corresponding path program 1 times [2023-10-12 17:28:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:39,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460714422] [2023-10-12 17:28:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:39,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:39,846 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:28:39,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:28:39,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:28:39,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:28:39,846 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:28:39,846 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:39,846 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:28:39,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:28:39,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:28:39,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:28:39,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:28:39,858 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:28:39,865 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:28:39,899 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:28:39,901 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:28:39,985 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:28:39,988 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:28:39,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:39,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:39,991 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:28:40,022 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:28:40,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:40,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:40,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:40,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:40,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:40,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:40,036 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:28:40,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:40,059 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:28:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,070 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:28:40,072 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:28:40,074 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:28:40,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:40,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:40,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:40,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:40,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:40,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:40,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:28:40,124 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:28:40,124 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:28:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,130 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:28:40,132 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:28:40,133 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:28:40,154 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:28:40,155 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:28:40,155 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:28:40,161 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:28:40,163 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:28:40,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:40,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:40,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:40,207 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:40,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:40,209 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:28:40,229 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:28:40,230 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:28:40,301 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 5 states and 256 transitions. [2023-10-12 17:28:40,302 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:40,304 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:28:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:28:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:28:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:28:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:28:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:40,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:28:40,333 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:28:40,333 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:28:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 554 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:28:40,334 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:28:40,337 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:28:40,337 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:28:40,337 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:28:40,337 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:28:40,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:40,342 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:28:40,342 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:28:40,342 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:40,343 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [2023-10-12 17:28:40,343 INFO L750 eck$LassoCheckResult]: Loop: 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 89#[L22-1, L59, L33-1]true [2023-10-12 17:28:40,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:28:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69796202] [2023-10-12 17:28:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:40,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 1 times [2023-10-12 17:28:40,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:40,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168092840] [2023-10-12 17:28:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:40,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:40,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash 125325192, now seen corresponding path program 1 times [2023-10-12 17:28:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476835753] [2023-10-12 17:28:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:40,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:40,506 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:28:40,556 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:28:40,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:28:40,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:28:40,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:28:40,557 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:28:40,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:28:40,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:28:40,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:28:40,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:28:40,557 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:28:40,560 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:28:40,562 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:28:40,634 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:28:40,637 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:28:40,640 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:28:40,642 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:28:40,814 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:28:40,814 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:28:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,815 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:28:40,825 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:28:40,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:40,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:40,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:40,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:40,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:40,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:40,837 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:28:40,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:40,850 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:28:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,852 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:28:40,854 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:28:40,855 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:28:40,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:40,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:40,862 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:28:40,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:40,876 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:28:40,876 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:28:40,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:40,912 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 [2023-10-12 17:28:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,917 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:28:40,918 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:28:40,920 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:28:40,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:40,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:40,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:40,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:40,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:40,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:40,961 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:28:40,971 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:28:40,971 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:28:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:40,982 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:28:40,984 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:28:41,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:28:41,080 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-10-12 17:28:41,080 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:28:41,080 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, j) = 1*k - 1*j Supporting invariants [-1*M + 1*k >= 0] [2023-10-12 17:28:41,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:28:41,102 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:28:41,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:41,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:28:41,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:41,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:28:41,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:41,163 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-10-12 17:28:41,163 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:28:41,407 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 10 states and 469 transitions. [2023-10-12 17:28:41,407 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:41,430 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2023-10-12 17:28:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:28:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2023-10-12 17:28:41,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:28:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:28:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:28:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:41,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:28:41,562 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 [2023-10-12 17:28:41,607 INFO L124 PetriNetUnfolderBase]: 470/718 cut-off events. [2023-10-12 17:28:41,608 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2023-10-12 17:28:41,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 718 events. 470/718 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2834 event pairs, 38 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 1548. Up to 250 conditions per place. [2023-10-12 17:28:41,615 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:28:41,649 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:28:41,649 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:28:41,649 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:28:41,649 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:28:41,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:41,683 INFO L124 PetriNetUnfolderBase]: 200/280 cut-off events. [2023-10-12 17:28:41,683 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:28:41,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:41,684 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:28:41,684 INFO L750 eck$LassoCheckResult]: Loop: 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:28:41,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash 178132276, now seen corresponding path program 1 times [2023-10-12 17:28:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456661850] [2023-10-12 17:28:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:41,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 4063, now seen corresponding path program 1 times [2023-10-12 17:28:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510900604] [2023-10-12 17:28:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:41,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash -613571502, now seen corresponding path program 1 times [2023-10-12 17:28:41,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:41,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927727809] [2023-10-12 17:28:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:41,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:42,176 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:28:42,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:28:42,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:28:42,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:28:42,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:28:42,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:42,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:28:42,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:28:42,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:28:42,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:28:42,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:28:42,184 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:28:42,188 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:28:42,461 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:28:42,464 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:28:42,466 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:28:42,468 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:28:42,471 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:28:42,473 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:28:42,632 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:28:42,938 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:28:42,938 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:28:42,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:42,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:42,957 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) [2023-10-12 17:28:42,964 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:28:42,964 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 [2023-10-12 17:28:42,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:42,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:42,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:42,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:42,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:42,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:42,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:43,009 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 [2023-10-12 17:28:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:43,011 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) [2023-10-12 17:28:43,013 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 [2023-10-12 17:28:43,014 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:28:43,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:43,020 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-10-12 17:28:43,021 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:28:43,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:43,065 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-10-12 17:28:43,066 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:28:43,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:28:43,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:28:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:43,129 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) [2023-10-12 17:28:43,158 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:28:43,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:28:43,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:28:43,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:28:43,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:28:43,166 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 [2023-10-12 17:28:43,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:28:43,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:28:43,184 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:28:43,191 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:28:43,191 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-10-12 17:28:43,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:43,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:43,193 INFO L229 MonitoredProcess]: Starting monitored process 12 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:28:43,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:28:43,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:28:43,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:28:43,217 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:28:43,217 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:28:43,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:28:43,225 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:28:43,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:28:43,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:43,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:43,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:43,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:43,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:43,268 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:28:43,268 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:28:43,269 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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) [2023-10-12 17:28:43,308 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 5 states and 256 transitions. [2023-10-12 17:28:43,310 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:43,509 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:43,510 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) [2023-10-12 17:28:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:28:43,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:28:43,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:43,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:28:43,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:43,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:28:43,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:28:45,364 INFO L124 PetriNetUnfolderBase]: 825/1213 cut-off events. [2023-10-12 17:28:45,365 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-10-12 17:28:45,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 1213 events. 825/1213 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5025 event pairs, 30 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 3192. Up to 475 conditions per place. [2023-10-12 17:28:45,366 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:28:45,728 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:28:45,729 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:28:45,729 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:28:45,729 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:28:46,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:46,636 INFO L124 PetriNetUnfolderBase]: 328/464 cut-off events. [2023-10-12 17:28:46,636 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-10-12 17:28:46,636 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:46,636 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [98] L22-1-->thread1EXIT: Formula: (<= v_N_10 v_i_13) InVars {N=v_N_10, i=v_i_13} OutVars{N=v_N_10, i=v_i_13} AuxVars[] AssignedVars[] 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:28:46,636 INFO L750 eck$LassoCheckResult]: Loop: 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:28:46,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1237858210, now seen corresponding path program 1 times [2023-10-12 17:28:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800533239] [2023-10-12 17:28:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:28:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800533239] [2023-10-12 17:28:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800533239] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:28:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275991716] [2023-10-12 17:28:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:28:46,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:28:46,712 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:28:46,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-10-12 17:28:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:46,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:28:46,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:46,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:28:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:28:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275991716] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:28:46,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:28:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-10-12 17:28:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622975329] [2023-10-12 17:28:46,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:28:46,813 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:28:46,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 2 times [2023-10-12 17:28:46,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:46,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514125995] [2023-10-12 17:28:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:46,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:46,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:28:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-10-12 17:28:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-10-12 17:28:46,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42016 transitions, 393152 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:28:46,886 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:28:46,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:28:58,971 INFO L124 PetriNetUnfolderBase]: 2213/3571 cut-off events. [2023-10-12 17:28:58,971 INFO L125 PetriNetUnfolderBase]: For 1177/1177 co-relation queries the response was YES. [2023-10-12 17:28:58,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 3571 events. 2213/3571 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 20781 event pairs, 42 based on Foata normal form. 0/2242 useless extension candidates. Maximal degree in co-relation 12021. Up to 1395 conditions per place. [2023-10-12 17:28:58,990 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 867 selfloop transitions, 277 changer transitions 516/1660 dead transitions. [2023-10-12 17:28:58,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:58,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:59,324 INFO L124 PetriNetUnfolderBase]: 2213/3571 cut-off events. [2023-10-12 17:28:59,324 INFO L125 PetriNetUnfolderBase]: For 1177/1177 co-relation queries the response was YES. [2023-10-12 17:28:59,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 3571 events. 2213/3571 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 20783 event pairs, 42 based on Foata normal form. 0/2242 useless extension candidates. Maximal degree in co-relation 12021. Up to 1395 conditions per place. [2023-10-12 17:28:59,327 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:59,341 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-10-12 17:28:59,343 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:59,343 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:28:59,343 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:28:59,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:28:59,440 INFO L124 PetriNetUnfolderBase]: 619/935 cut-off events. [2023-10-12 17:28:59,440 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2023-10-12 17:28:59,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:28:59,441 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:28:59,441 INFO L750 eck$LassoCheckResult]: Loop: 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:28:59,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1237858179, now seen corresponding path program 2 times [2023-10-12 17:28:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:59,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876982232] [2023-10-12 17:28:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:59,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 3 times [2023-10-12 17:28:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923691428] [2023-10-12 17:28:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:59,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -124227869, now seen corresponding path program 3 times [2023-10-12 17:28:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:28:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541634565] [2023-10-12 17:28:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:28:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:28:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:28:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:28:59,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:28:59,914 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:28:59,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:28:59,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:28:59,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:28:59,914 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:28:59,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:28:59,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:28:59,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:28:59,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:28:59,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:28:59,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:28:59,967 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:29:05,155 WARN L223 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 505 DAG size of output: 55 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-10-12 17:29:05,239 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:29:05,241 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:29:05,243 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:29:05,245 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:29:05,246 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:29:05,248 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:29:05,250 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:29:05,370 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:29:07,639 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:07,640 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,641 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:07,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:29:07,649 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:29:07,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:07,656 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-10-12 17:29:07,656 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:29:07,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:07,773 INFO L401 nArgumentSynthesizer]: We have 104 Motzkin's Theorem applications. [2023-10-12 17:29:07,773 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:29:07,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:07,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,917 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:07,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:29:07,922 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:29:07,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:07,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:07,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:07,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:07,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:07,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:07,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:07,979 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:29:07,979 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:29:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,982 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:07,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:29:07,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:08,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:08,005 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:08,005 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:29:08,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:08,017 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:29:08,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:08,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:08,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:08,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:08,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:08,055 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 [2023-10-12 17:29:08,056 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:29:08,144 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 7 states and 338 transitions. [2023-10-12 17:29:08,145 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:08,346 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:08,347 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 [2023-10-12 17:29:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:29:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:29:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:29:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:29:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:09,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:32,912 INFO L124 PetriNetUnfolderBase]: 5745/9190 cut-off events. [2023-10-12 17:29:32,912 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2023-10-12 17:29:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57383 conditions, 9190 events. 5745/9190 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 62022 event pairs, 67 based on Foata normal form. 0/5611 useless extension candidates. Maximal degree in co-relation 41720. Up to 3711 conditions per place. [2023-10-12 17:29:32,918 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:33,194 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:33,194 INFO L430 stractBuchiCegarLoop]: Abstraction has has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:33,194 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:29:33,194 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:57,372 INFO L124 PetriNetUnfolderBase]: 5745/9190 cut-off events. [2023-10-12 17:29:57,373 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2023-10-12 17:29:57,373 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:29:57,378 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:29:57 BoogieIcfgContainer [2023-10-12 17:29:57,378 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:29:57,380 INFO L158 Benchmark]: Toolchain (without parser) took 78458.94ms. Allocated memory was 210.8MB in the beginning and 966.8MB in the end (delta: 756.0MB). Free memory was 160.0MB in the beginning and 592.2MB in the end (delta: -432.2MB). Peak memory consumption was 838.2MB. Max. memory is 8.0GB. [2023-10-12 17:29:57,385 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 210.8MB. Free memory was 161.2MB in the beginning and 161.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:29:57,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.96ms. Allocated memory is still 210.8MB. Free memory was 159.9MB in the beginning and 158.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:57,386 INFO L158 Benchmark]: Boogie Preprocessor took 20.85ms. Allocated memory is still 210.8MB. Free memory was 158.4MB in the beginning and 157.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:57,386 INFO L158 Benchmark]: RCFGBuilder took 212.49ms. Allocated memory is still 210.8MB. Free memory was 157.3MB in the beginning and 176.5MB in the end (delta: -19.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2023-10-12 17:29:57,388 INFO L158 Benchmark]: BuchiAutomizer took 78198.15ms. Allocated memory was 210.8MB in the beginning and 966.8MB in the end (delta: 756.0MB). Free memory was 176.2MB in the beginning and 592.2MB in the end (delta: -416.0MB). Peak memory consumption was 853.6MB. Max. memory is 8.0GB. [2023-10-12 17:29:57,390 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.24ms. Allocated memory is still 210.8MB. Free memory was 161.2MB in the beginning and 161.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.96ms. Allocated memory is still 210.8MB. Free memory was 159.9MB in the beginning and 158.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.85ms. Allocated memory is still 210.8MB. Free memory was 158.4MB in the beginning and 157.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 212.49ms. Allocated memory is still 210.8MB. Free memory was 157.3MB in the beginning and 176.5MB in the end (delta: -19.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 78198.15ms. Allocated memory was 210.8MB in the beginning and 966.8MB in the end (delta: 756.0MB). Free memory was 176.2MB in the beginning and 592.2MB in the end (delta: -416.0MB). Peak memory consumption was 853.6MB. 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 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function k + -1 * j and consists of 7 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 78.1s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 11.8s. Construction of modules took 0.3s. Büchi inclusion checks took 13.2s. Highest rank in rank-based complementation 0. 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 687 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 211 mSDtfsCounter, 687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf100 lsp1526 ukn23 mio100 lsp69 div100 bol100 ite100 ukn100 eq160 hnf96 smp97 dnf2178 smp32 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 260ms VariablesStem: 9 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 104 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, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 0, independent unconditional: 106, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 106, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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:29:57,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-10-12 17:29:57,627 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...