/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/three-array-min.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:32:10,572 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:32:10,634 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:32:10,656 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:32:10,657 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:32:10,657 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:32:10,658 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:32:10,658 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:32:10,658 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:32:10,659 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:32:10,659 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:32:10,659 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:32:10,659 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:32:10,660 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:32:10,660 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:32:10,660 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:32:10,660 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:32:10,668 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:32:10,669 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:32:10,669 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:32:10,670 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:32:10,671 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:32:10,671 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:32:10,672 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:32:10,673 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:32:10,673 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:32:10,673 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:32:10,673 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:32:10,673 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:32:10,673 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:32:10,674 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:32:10,674 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:32:10,674 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:32:10,675 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:32:10,676 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:32:10,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:32:10,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:32:10,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:32:10,896 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:32:10,897 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:32:10,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl [2023-10-12 17:32:10,899 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl' [2023-10-12 17:32:10,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:32:10,930 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:32:10,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:32:10,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:32:10,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:32:10,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,955 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:32:10,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:32:10,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:32:10,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:32:10,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:32:10,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:32:10,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:32:10,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:32:10,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:32:10,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/1) ... [2023-10-12 17:32:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:11,015 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:32:11,024 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:32:11,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:32:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:32:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:32:11,045 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:32:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:32:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:32:11,046 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:32:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:32:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:32:11,046 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:32:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:32:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:32:11,047 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:32:11,088 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:32:11,090 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:32:11,204 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:32:11,219 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:32:11,220 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:32:11,221 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:32:11 BoogieIcfgContainer [2023-10-12 17:32:11,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:32:11,222 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:32:11,222 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:32:11,228 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:32:11,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:32:11,229 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:10" (1/2) ... [2023-10-12 17:32:11,230 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129e4849 and model type three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:32:11, skipping insertion in model container [2023-10-12 17:32:11,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:32:11,230 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:32:11" (2/2) ... [2023-10-12 17:32:11,231 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-min.wvr.bpl [2023-10-12 17:32:11,285 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:32:11,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:32:11,323 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:32:11,323 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:32:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:32:11,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:32:11,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2023-10-12 17:32:11,331 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:32:11,340 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:32:11,342 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:32:11,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 76 flow [2023-10-12 17:32:11,348 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:32:11,348 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:32:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:32:11,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:32:11,647 INFO L134 LiptonReduction]: Checked pairs total: 212 [2023-10-12 17:32:11,647 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:32:11,656 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:32:11,657 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:32:11,657 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:32:11,657 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:32:11,657 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:32:11,657 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:32:11,657 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:32:11,657 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:32:11,657 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:32:11,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:11,662 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:32:11,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:32:11,663 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:11,667 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:32:11,667 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:32:11,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:11,671 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:32:11,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:32:11,671 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:11,675 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [2023-10-12 17:32:11,676 INFO L750 eck$LassoCheckResult]: Loop: 46#[L67-1, L25-1]true [110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i] 46#[L67-1, L25-1]true [2023-10-12 17:32:11,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 4778, now seen corresponding path program 1 times [2023-10-12 17:32:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:11,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766936634] [2023-10-12 17:32:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:11,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:32:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334373619] [2023-10-12 17:32:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:11,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash 148228, now seen corresponding path program 1 times [2023-10-12 17:32:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522743569] [2023-10-12 17:32:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:11,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:12,072 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:12,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:12,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:12,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:12,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:12,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:12,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:12,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:32:12,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:12,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:12,094 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:32:12,102 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:32:12,104 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:32:12,107 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:32:12,110 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:32:12,401 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:12,405 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,409 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:32:12,410 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:32:12,412 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:32:12,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:12,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:12,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:12,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:12,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:12,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:12,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:12,446 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:32:12,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,447 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:32:12,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:12,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:12,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:12,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:12,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:12,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:12,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:12,485 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:32:12,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:12,493 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:32:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,495 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:32:12,497 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:32:12,499 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:32:12,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:12,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:12,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:12,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:12,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:12,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:12,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:12,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:32:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,552 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:32:12,554 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:32:12,556 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:32:12,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:12,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:12,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:12,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:12,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:12,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:12,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:12,601 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:32:12,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,603 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:32:12,605 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:32:12,607 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:32:12,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:12,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:12,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:12,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:12,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:12,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:12,636 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:12,664 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:32:12,664 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:32:12,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,668 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:32:12,669 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:32:12,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:12,713 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:12,713 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:12,714 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:32:12,719 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:32:12,721 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:32:12,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:12,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:12,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:12,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:32:12,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:12,766 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:32:12,789 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:32:12,790 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:32:12,889 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 286 transitions. [2023-10-12 17:32:12,890 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:12,893 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:12,895 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:32:12,898 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:32:12,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:32:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:32:12,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:32:12,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:12,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:32:12,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:12,948 INFO L124 PetriNetUnfolderBase]: 207/302 cut-off events. [2023-10-12 17:32:12,948 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-10-12 17:32:12,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 302 events. 207/302 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 886 event pairs, 19 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 468. Up to 104 conditions per place. [2023-10-12 17:32:12,950 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:12,952 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:12,952 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:12,952 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:32:12,952 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:12,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:12,957 INFO L124 PetriNetUnfolderBase]: 26/40 cut-off events. [2023-10-12 17:32:12,958 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:32:12,958 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:12,958 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [100] L67-1-->L37-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] 91#[L37-1, L68, L25-1]true [2023-10-12 17:32:12,958 INFO L750 eck$LassoCheckResult]: Loop: 91#[L37-1, L68, L25-1]true [115] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (< v_k_27 v_N_22) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_B_19 v_k_27) (select v_A_21 v_k_27)))) (= v_k_26 v_p_16)) InVars {A=v_A_21, N=v_N_22, k=v_k_27, C=v_C_23, B=v_B_19} OutVars{A=v_A_21, p=v_p_16, N=v_N_22, k=v_k_26, C=v_C_22, B=v_B_19} AuxVars[] AssignedVars[p, k, C] 91#[L37-1, L68, L25-1]true [115] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (< v_k_27 v_N_22) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_B_19 v_k_27) (select v_A_21 v_k_27)))) (= v_k_26 v_p_16)) InVars {A=v_A_21, N=v_N_22, k=v_k_27, C=v_C_23, B=v_B_19} OutVars{A=v_A_21, p=v_p_16, N=v_N_22, k=v_k_26, C=v_C_22, B=v_B_19} AuxVars[] AssignedVars[p, k, C] 91#[L37-1, L68, L25-1]true [2023-10-12 17:32:12,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 148218, now seen corresponding path program 1 times [2023-10-12 17:32:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977173723] [2023-10-12 17:32:12,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:12,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:12,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:12,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 4641, now seen corresponding path program 1 times [2023-10-12 17:32:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173004675] [2023-10-12 17:32:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:12,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:12,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:12,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 142441178, now seen corresponding path program 1 times [2023-10-12 17:32:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876760240] [2023-10-12 17:32:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,132 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:13,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:13,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:13,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:13,132 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:13,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:13,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:13,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:32:13,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:13,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:13,134 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:32:13,137 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:32:13,139 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:32:13,173 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:32:13,175 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:32:13,177 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:32:13,258 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:13,259 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,260 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:32:13,262 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:32:13,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:13,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:13,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:13,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:13,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:13,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:13,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:13,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:13,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,293 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:32:13,295 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:32:13,297 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:32:13,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:13,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:13,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:13,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:13,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:13,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:13,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:13,338 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:32:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,340 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:32:13,359 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:32:13,360 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:32:13,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:13,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:13,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:13,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:13,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:13,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:13,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:13,406 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:32:13,406 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:32:13,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,417 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:32:13,420 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:32:13,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:13,430 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:13,430 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:13,430 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:32:13,437 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:32:13,439 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:32:13,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:13,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:13,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:13,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:13,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:13,491 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:32:13,492 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:32:13,492 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) 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:32:13,620 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) 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 7 states and 377 transitions. [2023-10-12 17:32:13,620 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:13,653 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:13,654 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:32:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) 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:32:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 245 transitions. [2023-10-12 17:32:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 245 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:32:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 245 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:32:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 245 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:32:13,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:13,807 INFO L124 PetriNetUnfolderBase]: 613/866 cut-off events. [2023-10-12 17:32:13,807 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-10-12 17:32:13,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 866 events. 613/866 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3134 event pairs, 30 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1848. Up to 309 conditions per place. [2023-10-12 17:32:13,811 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:13,846 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:13,847 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:13,847 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:32:13,847 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:13,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:13,908 INFO L124 PetriNetUnfolderBase]: 295/391 cut-off events. [2023-10-12 17:32:13,908 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-10-12 17:32:13,909 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:13,909 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [109] L25-1-->thread1EXIT: Formula: (<= v_N_10 v_i_14) InVars {N=v_N_10, i=v_i_14} OutVars{N=v_N_10, i=v_i_14} AuxVars[] AssignedVars[] 148#[L67-1, thread1EXIT]true [100] L67-1-->L37-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] 150#[L37-1, L68, thread1EXIT]true [103] L68-->L49-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] 152#[L37-1, L69, thread1EXIT, L49-1]true [2023-10-12 17:32:13,910 INFO L750 eck$LassoCheckResult]: Loop: 152#[L37-1, L69, thread1EXIT, L49-1]true [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 152#[L37-1, L69, thread1EXIT, L49-1]true [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 152#[L37-1, L69, thread1EXIT, L49-1]true [2023-10-12 17:32:13,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 142449350, now seen corresponding path program 1 times [2023-10-12 17:32:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548166509] [2023-10-12 17:32:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 4577, now seen corresponding path program 1 times [2023-10-12 17:32:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565445027] [2023-10-12 17:32:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -545124506, now seen corresponding path program 1 times [2023-10-12 17:32:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114887520] [2023-10-12 17:32:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,007 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:32:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:32:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114887520] [2023-10-12 17:32:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114887520] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:32:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:32:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:32:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318218749] [2023-10-12 17:32:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:32:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:32:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:32:14,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:32:14,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 2992 transitions, 21408 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:32:14,028 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:32:14,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:32:14,254 INFO L124 PetriNetUnfolderBase]: 859/1274 cut-off events. [2023-10-12 17:32:14,254 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-10-12 17:32:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 1274 events. 859/1274 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5270 event pairs, 15 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 3522. Up to 909 conditions per place. [2023-10-12 17:32:14,263 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 235 selfloop transitions, 23 changer transitions 83/341 dead transitions. [2023-10-12 17:32:14,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,335 INFO L124 PetriNetUnfolderBase]: 859/1274 cut-off events. [2023-10-12 17:32:14,335 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-10-12 17:32:14,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 1274 events. 859/1274 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5266 event pairs, 15 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 3522. Up to 909 conditions per place. [2023-10-12 17:32:14,337 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,341 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:32:14,342 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,343 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:32:14,343 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 places, 341 transitions, 3016 flow [2023-10-12 17:32:14,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:14,378 INFO L124 PetriNetUnfolderBase]: 259/369 cut-off events. [2023-10-12 17:32:14,378 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-10-12 17:32:14,378 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:14,378 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [100] L67-1-->L37-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] 91#[L37-1, L68, L25-1]true [110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i] 91#[L37-1, L68, L25-1]true [103] L68-->L49-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] 173#[L37-1, L69, L25-1, L49-1]true [2023-10-12 17:32:14,379 INFO L750 eck$LassoCheckResult]: Loop: 173#[L37-1, L69, L25-1, L49-1]true [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 173#[L37-1, L69, L25-1, L49-1]true [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 173#[L37-1, L69, L25-1, L49-1]true [2023-10-12 17:32:14,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash 142441011, now seen corresponding path program 1 times [2023-10-12 17:32:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346332827] [2023-10-12 17:32:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 4577, now seen corresponding path program 2 times [2023-10-12 17:32:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219628346] [2023-10-12 17:32:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -553138285, now seen corresponding path program 1 times [2023-10-12 17:32:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444917567] [2023-10-12 17:32:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,706 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:32:14 BoogieIcfgContainer [2023-10-12 17:32:14,707 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:32:14,709 INFO L158 Benchmark]: Toolchain (without parser) took 3776.92ms. Allocated memory was 250.6MB in the beginning and 455.1MB in the end (delta: 204.5MB). Free memory was 203.6MB in the beginning and 220.0MB in the end (delta: -16.4MB). Peak memory consumption was 187.7MB. Max. memory is 8.0GB. [2023-10-12 17:32:14,710 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.35ms. Allocated memory is still 250.6MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 66.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:32:14,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.40ms. Allocated memory is still 250.6MB. Free memory was 203.5MB in the beginning and 202.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:32:14,711 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 250.6MB. Free memory was 202.0MB in the beginning and 200.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:32:14,712 INFO L158 Benchmark]: RCFGBuilder took 243.52ms. Allocated memory is still 250.6MB. Free memory was 200.9MB in the beginning and 190.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:32:14,716 INFO L158 Benchmark]: BuchiAutomizer took 3484.34ms. Allocated memory was 250.6MB in the beginning and 455.1MB in the end (delta: 204.5MB). Free memory was 190.0MB in the beginning and 220.0MB in the end (delta: -30.1MB). Peak memory consumption was 174.0MB. Max. memory is 8.0GB. [2023-10-12 17:32:14,719 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.35ms. Allocated memory is still 250.6MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 66.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.40ms. Allocated memory is still 250.6MB. Free memory was 203.5MB in the beginning and 202.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 250.6MB. Free memory was 202.0MB in the beginning and 200.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.52ms. Allocated memory is still 250.6MB. Free memory was 200.9MB in the beginning and 190.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3484.34ms. Allocated memory was 250.6MB in the beginning and 455.1MB in the end (delta: 204.5MB). Free memory was 190.0MB in the beginning and 220.0MB in the end (delta: -30.1MB). Peak memory consumption was 174.0MB. 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 3016 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 101 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp105 ukn48 mio100 lsp71 div100 bol100 ite100 ukn100 eq174 hnf93 smp100 dnf291 smp65 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L24] COND TRUE 1 i < N [L26] 1 mina := (if mina < A[i] then mina else A[i]); [L27] 1 minb := (if minb < B[i] then minb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, mina=-6424, minb=-1, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, mina=-6424, minb=-1, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L24] COND TRUE 1 i < N [L26] 1 mina := (if mina < A[i] then mina else A[i]); [L27] 1 minb := (if minb < B[i] then minb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, mina=-6424, minb=-1, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, mina=-6424, minb=-1, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 23 PlacesAfterwards, 29 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:32:14,755 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...