/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/chl/name-comparator-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:23:36,112 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:23:36,155 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:23:36,174 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:23:36,174 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:23:36,174 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:23:36,176 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:23:36,176 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:23:36,176 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:23:36,177 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:23:36,177 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:23:36,177 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:23:36,178 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:23:36,178 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:23:36,178 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:23:36,179 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:23:36,179 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:23:36,179 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:23:36,180 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:23:36,180 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:23:36,180 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:23:36,181 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:23:36,181 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:23:36,181 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:23:36,182 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:23:36,182 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:23:36,182 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:23:36,183 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:23:36,183 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:23:36,183 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:23:36,184 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:23:36,184 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:23:36,184 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:23:36,186 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:23:36,186 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:23:36,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:23:36,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:23:36,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:23:36,444 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:23:36,445 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:23:36,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl [2023-10-12 17:23:36,447 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl' [2023-10-12 17:23:36,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:23:36,476 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:23:36,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:36,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:23:36,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:23:36,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,500 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:23:36,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:36,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:23:36,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:23:36,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:23:36,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:23:36,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:23:36,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:23:36,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:23:36,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/1) ... [2023-10-12 17:23:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:36,577 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:23:36,586 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:23:36,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:23:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:23:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:23:36,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:23:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:23:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:23:36,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:23:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:23:36,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:23:36,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:23:36,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:23:36,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:23:36,620 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:23:36,667 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:23:36,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:23:36,821 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:23:36,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:23:36,928 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:23:36,938 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:23:36 BoogieIcfgContainer [2023-10-12 17:23:36,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:23:36,939 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:23:36,940 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:23:36,946 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:23:36,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:36,947 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:36" (1/2) ... [2023-10-12 17:23:36,949 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b388954 and model type name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:23:36, skipping insertion in model container [2023-10-12 17:23:36,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:36,949 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:23:36" (2/2) ... [2023-10-12 17:23:36,950 INFO L332 chiAutomizerObserver]: Analyzing ICFG name-comparator-trans.wvr.bpl [2023-10-12 17:23:37,031 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:23:37,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:23:37,087 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:23:37,088 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:37,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:23:37,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:23:37,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2023-10-12 17:23:37,098 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:23:37,121 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:23:37,123 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:23:37,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2023-10-12 17:23:37,136 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:23:37,137 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:37,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:23:37,140 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:23:37,301 INFO L134 LiptonReduction]: Checked pairs total: 88 [2023-10-12 17:23:37,301 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:23:37,312 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:23:37,312 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:23:37,313 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:23:37,313 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:23:37,313 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:23:37,313 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:23:37,313 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:23:37,313 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:23:37,314 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:23:37,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:37,339 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:23:37,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:37,340 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:37,344 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:23:37,344 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:23:37,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:37,346 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:23:37,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:37,346 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:37,365 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7] 40#[L36, L107]true [2023-10-12 17:23:37,365 INFO L750 eck$LassoCheckResult]: Loop: 40#[L36, L107]true [118] L36-->L36: Formula: (let ((.cse1 (not v_break_7_52)) (.cse4 (= v_name_2_31 v_current_6_16))) (let ((.cse2 (not v_break_7_41)) (.cse3 (and .cse1 .cse4)) (.cse0 (= v_name_1_39 v_current_6_16))) (and (< v_i_5_30 3) (= (select v_nondet_0_18 v_i_5_30) v_current_6_16) (or (and v_break_7_52 (or .cse0 v_break_7_41)) (and .cse1 (not .cse0) .cse2)) (or (and (or .cse3 v_break_7_52) v_break_7_40) (and .cse1 (not v_break_7_40) (or (not .cse4) v_break_7_52))) .cse2 (= (+ v_i_5_30 1) v_i_5_29) (= v_result_4_38 (ite .cse3 (- 1) (ite .cse0 1 v_result_4_40)))))) InVars {name_2=v_name_2_31, i_5=v_i_5_30, result_4=v_result_4_40, break_7=v_break_7_41, name_1=v_name_1_39, nondet_0=v_nondet_0_18} OutVars{name_2=v_name_2_31, i_5=v_i_5_29, result_4=v_result_4_38, break_7=v_break_7_40, current_6=v_current_6_16, name_1=v_name_1_39, nondet_0=v_nondet_0_18} AuxVars[v_break_7_52] AssignedVars[i_5, result_4, break_7, current_6] 40#[L36, L107]true [2023-10-12 17:23:37,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2023-10-12 17:23:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617145105] [2023-10-12 17:23:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:37,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:23:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270991913] [2023-10-12 17:23:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:37,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:37,512 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2023-10-12 17:23:37,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:37,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34509218] [2023-10-12 17:23:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:37,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:37,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:37,881 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:37,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:37,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:37,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:37,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:37,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:37,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:37,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:37,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:23:37,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:37,883 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:37,899 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:38,034 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:23:38,133 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:23:38,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:38,509 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:38,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:38,517 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:23:38,520 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:23:38,687 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:23:38,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:38,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:38,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:38,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:38,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:38,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:38,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:38,725 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:23:38,725 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:23:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:38,738 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:23:38,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:38,786 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:23:38,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:23:38,790 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:38,790 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2023-10-12 17:23:38,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:23:38,797 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:23:38,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:38,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:38,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:38,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:23:38,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:38,865 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:23:38,896 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:23:38,898 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:23:39,006 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 6 states and 228 transitions. [2023-10-12 17:23:39,007 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:39,010 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:39,012 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:23:39,015 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:23:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:23:39,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:23:39,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:39,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:23:39,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:39,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:23:39,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:39,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 226 transitions, 1156 flow [2023-10-12 17:23:39,094 INFO L124 PetriNetUnfolderBase]: 373/537 cut-off events. [2023-10-12 17:23:39,094 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-10-12 17:23:39,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 537 events. 373/537 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1670 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 1045. Up to 169 conditions per place. [2023-10-12 17:23:39,096 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 36 places, 226 transitions, 1156 flow [2023-10-12 17:23:39,101 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 36 places, 226 transitions, 1156 flow [2023-10-12 17:23:39,101 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 226 transitions, 1156 flow [2023-10-12 17:23:39,101 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:23:39,102 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 226 transitions, 1156 flow [2023-10-12 17:23:39,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:39,110 INFO L124 PetriNetUnfolderBase]: 38/59 cut-off events. [2023-10-12 17:23:39,110 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:23:39,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:39,111 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7] 40#[L36, L107]true [133] L107-->$Ultimate##0: 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] 87#[$Ultimate##0, L36, L108]true [120] $Ultimate##0-->L62: Formula: (let ((.cse1 (not v_break_11_52)) (.cse0 (= v_name_3_33 v_name_2_33))) (and (= v_result_8_30 (ite .cse0 0 v_result_8_31)) .cse1 (or (and (not v_break_11_36) (not .cse0) .cse1) (and (or v_break_11_52 .cse0) v_break_11_36)) (= v_i_9_23 0))) InVars {name_3=v_name_3_33, result_8=v_result_8_31, name_2=v_name_2_33} OutVars{name_3=v_name_3_33, result_8=v_result_8_30, name_2=v_name_2_33, break_11=v_break_11_36, i_9=v_i_9_23} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9] 89#[L36, L108, L62]true [121] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse0 (not v_break_11_42)) (.cse1 (= v_name_2_35 v_current_10_16)) (.cse3 (and .cse2 .cse4))) (and .cse0 (or (and v_break_11_54 (or v_break_11_42 .cse1)) (and .cse0 (not .cse1) .cse2)) (= (ite .cse3 (- 1) (ite .cse1 1 v_result_8_36)) v_result_8_34) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse3) v_break_11_40) (and .cse2 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, name_2=v_name_2_35, break_11=v_break_11_42, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, name_2=v_name_2_35, break_11=v_break_11_40, current_10=v_current_10_16, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9] 89#[L36, L108, L62]true [2023-10-12 17:23:39,111 INFO L750 eck$LassoCheckResult]: Loop: 89#[L36, L108, L62]true [121] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse0 (not v_break_11_42)) (.cse1 (= v_name_2_35 v_current_10_16)) (.cse3 (and .cse2 .cse4))) (and .cse0 (or (and v_break_11_54 (or v_break_11_42 .cse1)) (and .cse0 (not .cse1) .cse2)) (= (ite .cse3 (- 1) (ite .cse1 1 v_result_8_36)) v_result_8_34) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse3) v_break_11_40) (and .cse2 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, name_2=v_name_2_35, break_11=v_break_11_42, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, name_2=v_name_2_35, break_11=v_break_11_40, current_10=v_current_10_16, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9] 89#[L36, L108, L62]true [121] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse0 (not v_break_11_42)) (.cse1 (= v_name_2_35 v_current_10_16)) (.cse3 (and .cse2 .cse4))) (and .cse0 (or (and v_break_11_54 (or v_break_11_42 .cse1)) (and .cse0 (not .cse1) .cse2)) (= (ite .cse3 (- 1) (ite .cse1 1 v_result_8_36)) v_result_8_34) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse3) v_break_11_40) (and .cse2 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, name_2=v_name_2_35, break_11=v_break_11_42, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, name_2=v_name_2_35, break_11=v_break_11_40, current_10=v_current_10_16, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9] 89#[L36, L108, L62]true [2023-10-12 17:23:39,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 152274291, now seen corresponding path program 1 times [2023-10-12 17:23:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503526195] [2023-10-12 17:23:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:39,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 4833, now seen corresponding path program 1 times [2023-10-12 17:23:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673783193] [2023-10-12 17:23:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:39,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 306709459, now seen corresponding path program 2 times [2023-10-12 17:23:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641712707] [2023-10-12 17:23:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:39,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:39,737 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:23:39,836 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:39,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:39,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:39,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:39,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:39,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:39,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:39,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:39,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:23:39,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:39,837 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:39,843 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:23:39,847 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:23:40,055 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:23:40,058 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:23:40,060 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:23:40,213 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2023-10-12 17:23:40,341 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-10-12 17:23:44,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:44,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:44,903 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:23:44,905 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:23:44,907 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:23:44,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:44,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:44,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:44,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:44,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:44,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:44,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:44,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:23:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:44,940 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:23:44,953 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:23:44,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:44,961 INFO L203 nArgumentSynthesizer]: 30 stem disjuncts [2023-10-12 17:23:44,961 INFO L204 nArgumentSynthesizer]: 24 loop disjuncts [2023-10-12 17:23:44,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:44,967 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:23:47,271 INFO L401 nArgumentSynthesizer]: We have 2640 Motzkin's Theorem applications. [2023-10-12 17:23:47,271 INFO L402 nArgumentSynthesizer]: A total of 48 supporting invariants were added. [2023-10-12 17:23:57,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:57,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:23:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:57,571 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:23:57,572 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:23:57,579 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:23:57,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:57,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:57,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:57,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:57,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:57,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:57,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:57,623 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:23:57,623 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:23:57,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:57,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:57,625 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:23:57,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:57,636 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:23:57,643 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:23:57,643 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:57,643 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -1*i_9 + 2 Supporting invariants [] [2023-10-12 17:23:57,651 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:23:57,654 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:23:57,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:57,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:57,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:57,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:23:57,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:57,704 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:23:57,706 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:23:57,706 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) 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:23:57,795 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Result 6 states and 228 transitions. [2023-10-12 17:23:57,795 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:57,814 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:57,815 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:23:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) 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:23:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:23:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:23:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:23:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:23:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 3012 transitions, 21600 flow [2023-10-12 17:23:57,903 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:23:58,112 INFO L124 PetriNetUnfolderBase]: 1377/1932 cut-off events. [2023-10-12 17:23:58,113 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-10-12 17:23:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6201 conditions, 1932 events. 1377/1932 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 7692 event pairs, 0 based on Foata normal form. 0/1103 useless extension candidates. Maximal degree in co-relation 5740. Up to 657 conditions per place. [2023-10-12 17:23:58,119 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 48 places, 3012 transitions, 21600 flow [2023-10-12 17:23:58,163 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 48 places, 3012 transitions, 21600 flow [2023-10-12 17:23:58,163 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 3012 transitions, 21600 flow [2023-10-12 17:23:58,163 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:23:58,164 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 3012 transitions, 21600 flow [2023-10-12 17:23:58,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:58,195 INFO L124 PetriNetUnfolderBase]: 116/162 cut-off events. [2023-10-12 17:23:58,195 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-10-12 17:23:58,196 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:58,198 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [133] L107-->$Ultimate##0: 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] 149#[$Ultimate##0, $Ultimate##0, L108]true [136] L108-->$Ultimate##0: 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] 151#[L109, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7] 153#[L109, $Ultimate##0, L36, $Ultimate##0]true [124] $Ultimate##0-->L88: Formula: (let ((.cse1 (not v_break_15_54)) (.cse0 (= v_name_3_31 v_name_1_37))) (and (= v_result_12_40 (ite .cse0 0 v_result_12_41)) .cse1 (= v_i_13_19 0) (or (and .cse1 (not v_break_15_44) (not .cse0)) (and v_break_15_44 (or .cse0 v_break_15_54))))) InVars {name_3=v_name_3_31, result_12=v_result_12_41, name_1=v_name_1_37} OutVars{name_3=v_name_3_31, result_12=v_result_12_40, i_13=v_i_13_19, name_1=v_name_1_37, break_15=v_break_15_44} AuxVars[v_break_15_54] AssignedVars[result_12, i_13, break_15] 155#[L109, $Ultimate##0, L36, L88]true [125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_1_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and .cse1 (not .cse0) .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_1=v_name_1_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, current_14=v_current_14_16, name_1=v_name_1_35, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15] 155#[L109, $Ultimate##0, L36, L88]true [2023-10-12 17:23:58,198 INFO L750 eck$LassoCheckResult]: Loop: 155#[L109, $Ultimate##0, L36, L88]true [125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_1_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and .cse1 (not .cse0) .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_1=v_name_1_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, current_14=v_current_14_16, name_1=v_name_1_35, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15] 155#[L109, $Ultimate##0, L36, L88]true [125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_1_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and .cse1 (not .cse0) .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_1=v_name_1_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, current_14=v_current_14_16, name_1=v_name_1_35, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15] 155#[L109, $Ultimate##0, L36, L88]true [2023-10-12 17:23:58,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 441321329, now seen corresponding path program 1 times [2023-10-12 17:23:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:58,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638285126] [2023-10-12 17:23:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:58,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 4961, now seen corresponding path program 1 times [2023-10-12 17:23:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:58,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003864161] [2023-10-12 17:23:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:58,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1091961135, now seen corresponding path program 2 times [2023-10-12 17:23:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498573029] [2023-10-12 17:23:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:58,753 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:58,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:58,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:58,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:58,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:58,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:58,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:58,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:58,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:23:58,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:58,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:58,756 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:23:58,987 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:23:58,990 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:23:58,992 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:23:58,994 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:23:58,996 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:23:58,998 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:23:59,000 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:23:59,160 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2023-10-12 17:23:59,254 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-10-12 17:24:03,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:24:03,045 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:24:03,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:24:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:24:03,051 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:24:03,053 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:24:03,055 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:24:03,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:24:03,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:24:03,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:24:03,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:24:03,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:24:03,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:24:03,066 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:24:03,072 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:24:03,072 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:24:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:24:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:24:03,073 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:24:03,075 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:24:03,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:24:03,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:24:03,083 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:24:03,083 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -1*i_13 + 2 Supporting invariants [] [2023-10-12 17:24:03,088 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:24:03,090 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:24:03,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:03,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:24:03,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:24:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:03,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:24:03,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:24:03,137 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:24:03,139 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:24:03,140 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:24:03,220 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 6 states and 228 transitions. [2023-10-12 17:24:03,220 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:24:03,425 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:24:03,533 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:24:03,534 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:24:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:24:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:24:03,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:24:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:24:03,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:24:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:24:03,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:24:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:24:03,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 40200 transitions, 370992 flow [2023-10-12 17:24:11,572 INFO L124 PetriNetUnfolderBase]: 4406/6139 cut-off events. [2023-10-12 17:24:11,572 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2023-10-12 17:24:11,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25489 conditions, 6139 events. 4406/6139 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 29696 event pairs, 6 based on Foata normal form. 0/3260 useless extension candidates. Maximal degree in co-relation 23485. Up to 2177 conditions per place. [2023-10-12 17:24:11,579 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 40200 transitions, 370992 flow [2023-10-12 17:24:11,958 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 40200 transitions, 370992 flow [2023-10-12 17:24:11,958 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 40200 transitions, 370992 flow [2023-10-12 17:24:11,958 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:24:11,959 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 40200 transitions, 370992 flow [2023-10-12 17:24:20,575 INFO L124 PetriNetUnfolderBase]: 4406/6139 cut-off events. [2023-10-12 17:24:20,576 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2023-10-12 17:24:20,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:24:20,580 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:24:20 BoogieIcfgContainer [2023-10-12 17:24:20,581 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:24:20,581 INFO L158 Benchmark]: Toolchain (without parser) took 44105.10ms. Allocated memory was 184.5MB in the beginning and 736.1MB in the end (delta: 551.6MB). Free memory was 139.0MB in the beginning and 409.1MB in the end (delta: -270.0MB). Peak memory consumption was 619.4MB. Max. memory is 8.0GB. [2023-10-12 17:24:20,582 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 184.5MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:24:20,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.41ms. Allocated memory is still 184.5MB. Free memory was 138.8MB in the beginning and 137.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:24:20,582 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 184.5MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:24:20,583 INFO L158 Benchmark]: RCFGBuilder took 397.17ms. Allocated memory is still 184.5MB. Free memory was 136.3MB in the beginning and 118.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-10-12 17:24:20,583 INFO L158 Benchmark]: BuchiAutomizer took 43641.20ms. Allocated memory was 184.5MB in the beginning and 736.1MB in the end (delta: 551.6MB). Free memory was 118.5MB in the beginning and 409.1MB in the end (delta: -290.6MB). Peak memory consumption was 599.5MB. Max. memory is 8.0GB. [2023-10-12 17:24:20,587 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.27ms. Allocated memory is still 184.5MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.41ms. Allocated memory is still 184.5MB. Free memory was 138.8MB in the beginning and 137.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 184.5MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 397.17ms. Allocated memory is still 184.5MB. Free memory was 136.3MB in the beginning and 118.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 43641.20ms. Allocated memory was 184.5MB in the beginning and 736.1MB in the end (delta: 551.6MB). Free memory was 118.5MB in the beginning and 409.1MB in the end (delta: -290.6MB). Peak memory consumption was 599.5MB. 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 (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + 2 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_13 + 2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.5s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 24.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 72 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp219 ukn43 mio100 lsp91 div100 bol112 ite100 ukn100 eq179 hnf99 smp100 dnf3358 smp19 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12547ms VariablesStem: 12 VariablesLoop: 9 DisjunctsStem: 30 DisjunctsLoop: 24 SupportingInvariants: 48 MotzkinApplications: 2640 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:24:20,608 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...