/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/unroll-cond-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:42,028 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:42,111 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:37:42,146 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:42,147 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:42,147 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:42,148 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:42,149 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:42,149 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:42,153 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:42,153 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:42,153 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:42,153 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:42,154 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:42,155 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:42,155 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:42,155 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:42,156 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:42,156 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:42,156 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:42,156 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:42,157 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:42,157 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:42,157 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:42,157 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:42,157 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:42,158 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:42,158 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:42,158 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:42,158 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:42,159 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:42,159 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:42,159 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:42,161 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:42,161 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:37:42,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:42,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:42,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:42,422 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:42,423 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:42,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl [2023-10-12 17:37:42,425 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl' [2023-10-12 17:37:42,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:42,457 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:42,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:42,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:42,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:42,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,485 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:42,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:42,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:42,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:42,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:42,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:42,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:42,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:42,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:42,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:42,576 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:37:42,598 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:37:42,615 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:42,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:42,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:42,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:42,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:42,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:42,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:42,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:42,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:42,618 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:37:42,670 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:42,672 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:42,753 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:42,791 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:42,791 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:37:42,792 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2023-10-12 17:37:42,793 INFO L201 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:42 BoogieIcfgContainer [2023-10-12 17:37:42,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:42,795 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:42,795 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:42,798 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:42,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:42,799 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/2) ... [2023-10-12 17:37:42,806 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53d813b4 and model type unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:42, skipping insertion in model container [2023-10-12 17:37:42,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:42,806 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:42" (2/2) ... [2023-10-12 17:37:42,807 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-cond-2.wvr.bpl [2023-10-12 17:37:42,852 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:42,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:37:42,892 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:37:42,892 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:42,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-10-12 17:37:42,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:37:42,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2023-10-12 17:37:42,903 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:42,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:37:42,919 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:37:42,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 14 transitions, 40 flow [2023-10-12 17:37:42,924 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:37:42,925 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:42,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-10-12 17:37:42,925 INFO L119 LiptonReduction]: Number of co-enabled transitions 22 [2023-10-12 17:37:42,991 INFO L134 LiptonReduction]: Checked pairs total: 22 [2023-10-12 17:37:42,991 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:37:43,006 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:43,006 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:43,006 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:43,006 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:43,006 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:43,006 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:43,007 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:43,007 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:43,007 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:37:43,010 ERROR L47 etriNetUnfolderRabin]: [1:1A:[45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[][5], 2:2A:[59] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[53] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 v_n_15) (= (select v_f_15 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_15, f=v_f_15} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_15, f=v_f_15} AuxVars[] AssignedVars[i1, x1][2]] [2023-10-12 17:37:43,012 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:43,012 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:43,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:43,012 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:43,015 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:43,015 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:37:43,017 ERROR L47 etriNetUnfolderRabin]: [1:1A:[45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[][5], 2:2A:[59] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[53] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 v_n_15) (= (select v_f_15 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_15, f=v_f_15} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_15, f=v_f_15} AuxVars[] AssignedVars[i1, x1][2]] [2023-10-12 17:37:43,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:43,017 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:43,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:43,018 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:43,022 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[] 27#[L52]true [59] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[L52-1, L20]true [2023-10-12 17:37:43,022 INFO L750 eck$LassoCheckResult]: Loop: 29#[L52-1, L20]true [53] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 v_n_15) (= (select v_f_15 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_15, f=v_f_15} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_15, f=v_f_15} AuxVars[] AssignedVars[i1, x1] 29#[L52-1, L20]true [2023-10-12 17:37:43,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2415, now seen corresponding path program 1 times [2023-10-12 17:37:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961664206] [2023-10-12 17:37:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2023-10-12 17:37:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043196823] [2023-10-12 17:37:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 74918, now seen corresponding path program 1 times [2023-10-12 17:37:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769246726] [2023-10-12 17:37:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,280 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:43,281 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:43,281 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:43,281 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:43,281 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:43,281 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,281 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:43,281 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:43,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:43,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:43,282 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:43,296 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:37:43,308 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:37:43,313 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:37:43,325 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:37:43,329 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:37:43,398 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:43,401 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,413 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:37:43,417 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:37:43,421 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:37:43,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:43,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:43,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:43,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:43,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:43,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:43,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:43,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:43,464 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:43,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,466 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:37:43,468 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:37:43,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:43,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:43,479 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:43,480 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2023-10-12 17:37:43,483 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:37:43,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:43,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:43,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:43,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:43,543 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:43,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:43,545 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:37:43,579 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:37:43,640 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:37:43,646 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:37:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2023-10-12 17:37:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:43,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:43,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:43,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,654 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:37:43,655 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:43,655 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:37:43,657 ERROR L47 etriNetUnfolderRabin]: [1:1A:[45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[][20], 2:2A:[59] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][24], 5:3A:[62] L52-1-->L33: 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][29]][6:4A:[54] L33-->L33: Formula: (and (< (+ v_i2_27 1) v_n_17) (= v_x2_25 (select v_f_17 (select v_f_17 v_x2_27))) (= v_i2_25 (+ 2 v_i2_27))) InVars {i2=v_i2_27, n=v_n_17, f=v_f_17, x2=v_x2_27} OutVars{i2=v_i2_25, n=v_n_17, f=v_f_17, x2=v_x2_25} AuxVars[] AssignedVars[x2, i2][18]] [2023-10-12 17:37:43,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:43,658 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2023-10-12 17:37:43,658 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:43,658 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:43,659 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[] 27#[L52]true [59] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[L52-1, L20]true [62] L52-1-->L33: 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] 64#[L33, L20, L53]true [2023-10-12 17:37:43,659 INFO L750 eck$LassoCheckResult]: Loop: 64#[L33, L20, L53]true [54] L33-->L33: Formula: (and (< (+ v_i2_27 1) v_n_17) (= v_x2_25 (select v_f_17 (select v_f_17 v_x2_27))) (= v_i2_25 (+ 2 v_i2_27))) InVars {i2=v_i2_27, n=v_n_17, f=v_f_17, x2=v_x2_27} OutVars{i2=v_i2_25, n=v_n_17, f=v_f_17, x2=v_x2_25} AuxVars[] AssignedVars[x2, i2] 64#[L33, L20, L53]true [2023-10-12 17:37:43,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 74927, now seen corresponding path program 1 times [2023-10-12 17:37:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576424793] [2023-10-12 17:37:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:37:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478695806] [2023-10-12 17:37:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2322791, now seen corresponding path program 1 times [2023-10-12 17:37:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289389252] [2023-10-12 17:37:43,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,823 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:43,823 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:43,823 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:43,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:43,824 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:43,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,824 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:43,824 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:43,824 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:43,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:43,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:43,827 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:37:43,830 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:37:43,834 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:37:43,836 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:37:43,849 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:37:43,855 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:37:43,859 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:37:43,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:43,936 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:43,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,941 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:37:43,954 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:37:43,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:43,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:43,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:43,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:43,965 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:37:43,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:43,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:43,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:43,985 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:37:43,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,988 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:37:44,000 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:37:44,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,013 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:37:44,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:44,043 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:37:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,045 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:37:44,048 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:37:44,049 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:37:44,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:44,083 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:37:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,085 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:37:44,096 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:37:44,100 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:37:44,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:44,129 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:37:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,131 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:37:44,140 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:37:44,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:44,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:44,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:44,149 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:37:44,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:44,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:37:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,171 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:37:44,177 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:37:44,180 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:37:44,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:44,217 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:44,218 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:44,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,223 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:44,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:37:44,238 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:44,259 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:44,260 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:44,260 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i2) = 1*n - 1*i2 Supporting invariants [] [2023-10-12 17:37:44,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:37:44,266 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:44,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:44,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:44,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:44,302 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:44,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:44,307 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:37:44,308 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:37:44,357 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:37:44,358 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:37:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2023-10-12 17:37:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,361 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 176 transitions, 1248 flow [2023-10-12 17:37:44,361 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:44,361 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 176 transitions, 1248 flow [2023-10-12 17:37:44,374 INFO L124 PetriNetUnfolderBase]: 16/32 cut-off events. [2023-10-12 17:37:44,374 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:37:44,374 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:44,384 INFO L201 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:44 BoogieIcfgContainer [2023-10-12 17:37:44,384 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:44,385 INFO L158 Benchmark]: Toolchain (without parser) took 1927.58ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 100.0MB in the end (delta: 38.5MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,386 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 184.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:44,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,387 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 184.5MB. Free memory was 136.8MB 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:37:44,387 INFO L158 Benchmark]: RCFGBuilder took 285.32ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 124.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,389 INFO L158 Benchmark]: BuchiAutomizer took 1589.46ms. Allocated memory is still 184.5MB. Free memory was 124.6MB in the beginning and 100.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,395 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.28ms. Allocated memory is still 184.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 184.5MB. Free memory was 136.8MB 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 285.32ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 124.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1589.46ms. Allocated memory is still 184.5MB. Free memory was 124.6MB in the beginning and 100.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.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 n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. 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, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 34 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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, 19 PlacesBefore, 16 PlacesAfterwards, 14 TransitionsBefore, 11 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 22, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, 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:37:44,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:44,614 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:37:44,813 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...