/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:06,533 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:06,585 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:38:06,602 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:06,602 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:06,602 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:06,604 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:06,604 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:06,604 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:06,605 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:06,605 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:06,605 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:06,606 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:06,606 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:06,606 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:06,607 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:06,607 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:06,607 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:06,608 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:06,608 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:06,608 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:06,609 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:06,609 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:06,609 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:06,609 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:06,610 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:06,610 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:06,610 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:06,610 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:06,611 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:06,611 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:06,611 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:06,611 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:06,612 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:06,613 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 -> RABIN_PETRI_NET [2023-10-12 17:38:06,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:06,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:06,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:06,863 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:06,863 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:06,865 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-symm.wvr.bpl [2023-10-12 17:38:06,865 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl' [2023-10-12 17:38:06,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:06,901 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:06,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:06,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:06,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:06,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,931 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:06,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:06,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:06,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:06,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:06,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:06,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:06,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:06,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:06,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/1) ... [2023-10-12 17:38:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:06,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:07,005 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:38:07,015 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:38:07,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:07,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:07,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:07,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:07,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:07,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:07,044 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:38:07,096 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:07,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:07,215 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:07,331 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:07,331 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:38:07,333 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:07 BoogieIcfgContainer [2023-10-12 17:38:07,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:07,335 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:07,335 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:07,338 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:07,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:07,339 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:06" (1/2) ... [2023-10-12 17:38:07,345 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3569d030 and model type name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:07, skipping insertion in model container [2023-10-12 17:38:07,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:07,345 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:07" (2/2) ... [2023-10-12 17:38:07,347 INFO L332 chiAutomizerObserver]: Analyzing ICFG name-comparator-symm.wvr.bpl [2023-10-12 17:38:07,398 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:38:07,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 56 flow [2023-10-12 17:38:07,439 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2023-10-12 17:38:07,440 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:07,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:38:07,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 56 flow [2023-10-12 17:38:07,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2023-10-12 17:38:07,451 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:07,462 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 44 flow [2023-10-12 17:38:07,465 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 44 flow [2023-10-12 17:38:07,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 44 flow [2023-10-12 17:38:07,471 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2023-10-12 17:38:07,471 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:07,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:38:07,472 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:38:07,582 INFO L134 LiptonReduction]: Checked pairs total: 31 [2023-10-12 17:38:07,582 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:38:07,595 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:07,595 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:07,595 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:07,595 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:07,596 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:07,596 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:07,596 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:07,596 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:07,597 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 12 transitions, 36 flow [2023-10-12 17:38:07,602 ERROR L47 etriNetUnfolderRabin]: [1:1A:[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 2:2A:[80] $Ultimate##0-->L31: Formula: (let ((.cse1 (not v_break_6_48)) (.cse0 (= v_name_1_37 v_name_2_37))) (and (= v_result_3_40 (ite .cse0 0 v_result_3_41)) (= v_i_4_27 0) .cse1 (or (and (not .cse0) .cse1 (not v_break_6_40)) (and (or .cse0 v_break_6_48) v_break_6_40)))) InVars {name_2=v_name_2_37, result_3=v_result_3_41, name_1=v_name_1_37} OutVars{name_2=v_name_2_37, i_4=v_i_4_27, result_3=v_result_3_40, name_1=v_name_1_37, break_6=v_break_6_40} AuxVars[v_break_6_48] AssignedVars[i_4, break_6, result_3][1]][3:3A:[82] L31-->L31: Formula: (let ((.cse1 (not v_break_6_50)) (.cse2 (= v_name_2_31 v_current_5_16))) (let ((.cse0 (and .cse1 .cse2)) (.cse3 (= v_name_1_31 v_current_5_16)) (.cse4 (not v_break_6_36))) (and (or (and (or .cse0 v_break_6_50) v_break_6_34) (and (not v_break_6_34) .cse1 (or (not .cse2) v_break_6_50))) (= v_result_3_36 (ite .cse0 (- 1) (ite .cse3 1 v_result_3_37))) (= (select v_nondet_0_11 v_i_4_24) v_current_5_16) (or (and .cse1 (not .cse3) .cse4) (and v_break_6_50 (or v_break_6_36 .cse3))) (< v_i_4_24 3) .cse4 (= (+ v_i_4_24 1) v_i_4_23)))) InVars {name_2=v_name_2_31, i_4=v_i_4_24, name_1=v_name_1_31, break_6=v_break_6_36, result_3=v_result_3_37, nondet_0=v_nondet_0_11} OutVars{name_2=v_name_2_31, i_4=v_i_4_23, current_5=v_current_5_16, name_1=v_name_1_31, break_6=v_break_6_34, result_3=v_result_3_36, nondet_0=v_nondet_0_11} AuxVars[v_break_6_50] AssignedVars[i_4, current_5, break_6, result_3][6]] [2023-10-12 17:38:07,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:07,608 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:07,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:07,608 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:07,615 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:07,616 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 12 transitions, 36 flow [2023-10-12 17:38:07,619 ERROR L47 etriNetUnfolderRabin]: [1:1A:[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 2:2A:[80] $Ultimate##0-->L31: Formula: (let ((.cse1 (not v_break_6_48)) (.cse0 (= v_name_1_37 v_name_2_37))) (and (= v_result_3_40 (ite .cse0 0 v_result_3_41)) (= v_i_4_27 0) .cse1 (or (and (not .cse0) .cse1 (not v_break_6_40)) (and (or .cse0 v_break_6_48) v_break_6_40)))) InVars {name_2=v_name_2_37, result_3=v_result_3_41, name_1=v_name_1_37} OutVars{name_2=v_name_2_37, i_4=v_i_4_27, result_3=v_result_3_40, name_1=v_name_1_37, break_6=v_break_6_40} AuxVars[v_break_6_48] AssignedVars[i_4, break_6, result_3][1]][3:3A:[82] L31-->L31: Formula: (let ((.cse1 (not v_break_6_50)) (.cse2 (= v_name_2_31 v_current_5_16))) (let ((.cse0 (and .cse1 .cse2)) (.cse3 (= v_name_1_31 v_current_5_16)) (.cse4 (not v_break_6_36))) (and (or (and (or .cse0 v_break_6_50) v_break_6_34) (and (not v_break_6_34) .cse1 (or (not .cse2) v_break_6_50))) (= v_result_3_36 (ite .cse0 (- 1) (ite .cse3 1 v_result_3_37))) (= (select v_nondet_0_11 v_i_4_24) v_current_5_16) (or (and .cse1 (not .cse3) .cse4) (and v_break_6_50 (or v_break_6_36 .cse3))) (< v_i_4_24 3) .cse4 (= (+ v_i_4_24 1) v_i_4_23)))) InVars {name_2=v_name_2_31, i_4=v_i_4_24, name_1=v_name_1_31, break_6=v_break_6_36, result_3=v_result_3_37, nondet_0=v_nondet_0_11} OutVars{name_2=v_name_2_31, i_4=v_i_4_23, current_5=v_current_5_16, name_1=v_name_1_31, break_6=v_break_6_34, result_3=v_result_3_36, nondet_0=v_nondet_0_11} AuxVars[v_break_6_50] AssignedVars[i_4, current_5, break_6, result_3][6]] [2023-10-12 17:38:07,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:07,620 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:07,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:07,620 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:07,625 INFO L748 eck$LassoCheckResult]: Stem: 27#[$Ultimate##0]true [90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[$Ultimate##0, L76]true [80] $Ultimate##0-->L31: Formula: (let ((.cse1 (not v_break_6_48)) (.cse0 (= v_name_1_37 v_name_2_37))) (and (= v_result_3_40 (ite .cse0 0 v_result_3_41)) (= v_i_4_27 0) .cse1 (or (and (not .cse0) .cse1 (not v_break_6_40)) (and (or .cse0 v_break_6_48) v_break_6_40)))) InVars {name_2=v_name_2_37, result_3=v_result_3_41, name_1=v_name_1_37} OutVars{name_2=v_name_2_37, i_4=v_i_4_27, result_3=v_result_3_40, name_1=v_name_1_37, break_6=v_break_6_40} AuxVars[v_break_6_48] AssignedVars[i_4, break_6, result_3] 31#[L31, L76]true [2023-10-12 17:38:07,625 INFO L750 eck$LassoCheckResult]: Loop: 31#[L31, L76]true [82] L31-->L31: Formula: (let ((.cse1 (not v_break_6_50)) (.cse2 (= v_name_2_31 v_current_5_16))) (let ((.cse0 (and .cse1 .cse2)) (.cse3 (= v_name_1_31 v_current_5_16)) (.cse4 (not v_break_6_36))) (and (or (and (or .cse0 v_break_6_50) v_break_6_34) (and (not v_break_6_34) .cse1 (or (not .cse2) v_break_6_50))) (= v_result_3_36 (ite .cse0 (- 1) (ite .cse3 1 v_result_3_37))) (= (select v_nondet_0_11 v_i_4_24) v_current_5_16) (or (and .cse1 (not .cse3) .cse4) (and v_break_6_50 (or v_break_6_36 .cse3))) (< v_i_4_24 3) .cse4 (= (+ v_i_4_24 1) v_i_4_23)))) InVars {name_2=v_name_2_31, i_4=v_i_4_24, name_1=v_name_1_31, break_6=v_break_6_36, result_3=v_result_3_37, nondet_0=v_nondet_0_11} OutVars{name_2=v_name_2_31, i_4=v_i_4_23, current_5=v_current_5_16, name_1=v_name_1_31, break_6=v_break_6_34, result_3=v_result_3_36, nondet_0=v_nondet_0_11} AuxVars[v_break_6_50] AssignedVars[i_4, current_5, break_6, result_3] 31#[L31, L76]true [2023-10-12 17:38:07,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 3831, now seen corresponding path program 1 times [2023-10-12 17:38:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091154872] [2023-10-12 17:38:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:07,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 113, now seen corresponding path program 1 times [2023-10-12 17:38:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119092166] [2023-10-12 17:38:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:07,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash 118843, now seen corresponding path program 1 times [2023-10-12 17:38:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854427577] [2023-10-12 17:38:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:07,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:08,238 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:08,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:08,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:08,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:08,239 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:08,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:08,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:08,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:08,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:08,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:08,240 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:08,256 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:38:08,446 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:38:08,538 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:38:08,925 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:08,930 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:08,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:08,941 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:38:08,944 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:38:08,946 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:38:08,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:08,957 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2023-10-12 17:38:08,957 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2023-10-12 17:38:08,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:09,121 INFO L401 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2023-10-12 17:38:09,122 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2023-10-12 17:38:09,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:09,372 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:38:09,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:09,374 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:38:09,383 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:38:09,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:09,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:09,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:09,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:09,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:09,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:09,401 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:38:09,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:09,452 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:09,453 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:09,457 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:38:09,459 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:38:09,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:09,517 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:09,518 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:09,518 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_4) = -2*i_4 + 5 Supporting invariants [] [2023-10-12 17:38:09,522 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:38:09,525 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:09,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:09,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:09,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:09,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:09,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:09,584 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:38:09,618 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:38:09,676 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:38:09,683 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:38:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2023-10-12 17:38:09,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:09,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:09,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:09,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,692 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 60 transitions, 300 flow [2023-10-12 17:38:09,692 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:09,692 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 60 transitions, 300 flow [2023-10-12 17:38:09,698 ERROR L47 etriNetUnfolderRabin]: [1:1A:[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][27], 4:2A:[93] L76-->$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][37], 13:3A:[84] $Ultimate##0-->L57: Formula: (let ((.cse0 (= v_name_1_39 v_name_2_39)) (.cse1 (not v_break_10_56))) (and (= v_i_8_19 0) (= v_result_7_40 (ite .cse0 0 v_result_7_41)) (or (and (or .cse0 v_break_10_56) v_break_10_48) (and (not .cse0) .cse1 (not v_break_10_48))) .cse1)) InVars {name_2=v_name_2_39, name_1=v_name_1_39, result_7=v_result_7_41} OutVars{break_10=v_break_10_48, name_2=v_name_2_39, name_1=v_name_1_39, i_8=v_i_8_19, result_7=v_result_7_40} AuxVars[v_break_10_56] AssignedVars[break_10, result_7, i_8][22]][14:4A:[86] L57-->L57: Formula: (let ((.cse1 (not v_break_10_58)) (.cse4 (= v_name_1_35 v_current_9_16))) (let ((.cse0 (= v_name_2_35 v_current_9_16)) (.cse3 (and .cse1 .cse4)) (.cse2 (not v_break_10_43))) (and (< v_i_8_16 3) (= (+ v_i_8_16 1) v_i_8_15) (or (and (or v_break_10_43 .cse0) v_break_10_58) (and .cse1 .cse2 (not .cse0))) (= v_current_9_16 (select v_nondet_0_15 v_i_8_16)) (= v_result_7_36 (ite .cse3 (- 1) (ite .cse0 1 v_result_7_37))) (or (and (or v_break_10_58 .cse3) v_break_10_42) (and (or v_break_10_58 (not .cse4)) .cse1 (not v_break_10_42))) .cse2))) InVars {break_10=v_break_10_43, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_37, nondet_0=v_nondet_0_15, i_8=v_i_8_16} OutVars{break_10=v_break_10_42, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_36, current_9=v_current_9_16, nondet_0=v_nondet_0_15, i_8=v_i_8_15} AuxVars[v_break_10_58] AssignedVars[break_10, result_7, current_9, i_8][2]] [2023-10-12 17:38:09,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:09,699 INFO L124 PetriNetUnfolderBase]: 6/13 cut-off events. [2023-10-12 17:38:09,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:09,699 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:09,700 INFO L748 eck$LassoCheckResult]: Stem: 27#[$Ultimate##0]true [90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[$Ultimate##0, L76]true [93] L76-->$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] 66#[$Ultimate##0, $Ultimate##0, L77]true [84] $Ultimate##0-->L57: Formula: (let ((.cse0 (= v_name_1_39 v_name_2_39)) (.cse1 (not v_break_10_56))) (and (= v_i_8_19 0) (= v_result_7_40 (ite .cse0 0 v_result_7_41)) (or (and (or .cse0 v_break_10_56) v_break_10_48) (and (not .cse0) .cse1 (not v_break_10_48))) .cse1)) InVars {name_2=v_name_2_39, name_1=v_name_1_39, result_7=v_result_7_41} OutVars{break_10=v_break_10_48, name_2=v_name_2_39, name_1=v_name_1_39, i_8=v_i_8_19, result_7=v_result_7_40} AuxVars[v_break_10_56] AssignedVars[break_10, result_7, i_8] 68#[L57, $Ultimate##0, L77]true [2023-10-12 17:38:09,700 INFO L750 eck$LassoCheckResult]: Loop: 68#[L57, $Ultimate##0, L77]true [86] L57-->L57: Formula: (let ((.cse1 (not v_break_10_58)) (.cse4 (= v_name_1_35 v_current_9_16))) (let ((.cse0 (= v_name_2_35 v_current_9_16)) (.cse3 (and .cse1 .cse4)) (.cse2 (not v_break_10_43))) (and (< v_i_8_16 3) (= (+ v_i_8_16 1) v_i_8_15) (or (and (or v_break_10_43 .cse0) v_break_10_58) (and .cse1 .cse2 (not .cse0))) (= v_current_9_16 (select v_nondet_0_15 v_i_8_16)) (= v_result_7_36 (ite .cse3 (- 1) (ite .cse0 1 v_result_7_37))) (or (and (or v_break_10_58 .cse3) v_break_10_42) (and (or v_break_10_58 (not .cse4)) .cse1 (not v_break_10_42))) .cse2))) InVars {break_10=v_break_10_43, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_37, nondet_0=v_nondet_0_15, i_8=v_i_8_16} OutVars{break_10=v_break_10_42, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_36, current_9=v_current_9_16, nondet_0=v_nondet_0_15, i_8=v_i_8_15} AuxVars[v_break_10_58] AssignedVars[break_10, result_7, current_9, i_8] 68#[L57, $Ultimate##0, L77]true [2023-10-12 17:38:09,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 119248, now seen corresponding path program 1 times [2023-10-12 17:38:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147139001] [2023-10-12 17:38:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 117, now seen corresponding path program 1 times [2023-10-12 17:38:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431622366] [2023-10-12 17:38:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash 3696774, now seen corresponding path program 1 times [2023-10-12 17:38:09,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663076079] [2023-10-12 17:38:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,879 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:38:10,059 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:10,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:10,060 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:10,060 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:10,060 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:10,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:10,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:10,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:10,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:10,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:10,064 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:38:10,067 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:38:10,070 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:38:10,167 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:38:10,266 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:38:10,585 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:10,585 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:10,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,593 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:38:10,597 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:38:10,601 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:38:10,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:10,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:10,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:10,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:10,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:10,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:10,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:10,628 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:38:10,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,630 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:38:10,633 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:38:10,634 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:38:10,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:10,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:10,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:10,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:10,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:10,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:10,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:10,674 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:38:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,676 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:38:10,679 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:38:10,680 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:38:10,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:10,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:10,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:10,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:10,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:10,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:10,704 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:10,723 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:10,723 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,725 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:38:10,727 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:38:10,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:10,750 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:10,750 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:10,750 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 5 Supporting invariants [] [2023-10-12 17:38:10,756 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:38:10,757 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:10,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:10,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:10,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:10,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:10,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:10,788 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:38:10,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:38:10,835 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:38:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2023-10-12 17:38:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,838 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 300 transitions, 2100 flow [2023-10-12 17:38:10,838 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:10,838 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 300 transitions, 2100 flow [2023-10-12 17:38:10,848 INFO L124 PetriNetUnfolderBase]: 25/48 cut-off events. [2023-10-12 17:38:10,848 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:38:10,848 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:10,853 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:10 BoogieIcfgContainer [2023-10-12 17:38:10,853 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:10,854 INFO L158 Benchmark]: Toolchain (without parser) took 3953.10ms. Allocated memory was 185.6MB in the beginning and 255.9MB in the end (delta: 70.3MB). Free memory was 138.4MB in the beginning and 126.0MB in the end (delta: 12.4MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2023-10-12 17:38:10,855 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 185.6MB. Free memory was 139.7MB in the beginning and 139.5MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:10,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.98ms. Allocated memory is still 185.6MB. Free memory was 138.4MB in the beginning and 136.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:10,856 INFO L158 Benchmark]: Boogie Preprocessor took 26.66ms. Allocated memory is still 185.6MB. Free memory was 136.7MB in the beginning and 135.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:10,856 INFO L158 Benchmark]: RCFGBuilder took 373.22ms. Allocated memory was 185.6MB in the beginning and 255.9MB in the end (delta: 70.3MB). Free memory was 135.7MB in the beginning and 226.9MB in the end (delta: -91.2MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:10,857 INFO L158 Benchmark]: BuchiAutomizer took 3519.07ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 126.0MB in the end (delta: 100.6MB). Peak memory consumption was 101.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:10,858 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.29ms. Allocated memory is still 185.6MB. Free memory was 139.7MB in the beginning and 139.5MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.98ms. Allocated memory is still 185.6MB. Free memory was 138.4MB in the beginning and 136.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.66ms. Allocated memory is still 185.6MB. Free memory was 136.7MB in the beginning and 135.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 373.22ms. Allocated memory was 185.6MB in the beginning and 255.9MB in the end (delta: 70.3MB). Free memory was 135.7MB in the beginning and 226.9MB in the end (delta: -91.2MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3519.07ms. Allocated memory is still 255.9MB. Free memory was 226.5MB in the beginning and 126.0MB in the end (delta: 100.6MB). Peak memory consumption was 101.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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_4 + 5 and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * i_8 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 36 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital96 mio100 ax100 hnf100 lsp207 ukn45 mio100 lsp87 div100 bol114 ite100 ukn100 eq174 hnf99 smp100 dnf616 smp23 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 430ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 154 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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.1s, 21 PlacesBefore, 17 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 31 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 31, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:38:10,870 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:38:11,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...