/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-5.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:42,077 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:42,152 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,183 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:42,184 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:42,184 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:42,188 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:42,188 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:42,189 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:42,192 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:42,192 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:42,193 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:42,193 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:42,194 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:42,194 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:42,194 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:42,195 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:42,195 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:42,195 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:42,196 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:42,196 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:42,196 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:42,197 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:42,197 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:42,198 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:42,198 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:42,198 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:42,198 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:42,198 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:42,199 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:42,199 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:42,200 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:42,200 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:42,201 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:42,201 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,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:42,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:42,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:42,470 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:42,472 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:42,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-5.wvr.bpl [2023-10-12 17:37:42,474 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-5.wvr.bpl' [2023-10-12 17:37:42,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:42,506 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:42,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:42,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:42,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:42,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,534 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:42,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:42,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:42,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:42,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:42,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:42,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:42,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:42,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:42,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/1) ... [2023-10-12 17:37:42,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:42,584 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,587 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,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:42,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:42,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:42,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:42,619 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:42,620 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:42,657 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:42,659 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:42,756 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:42,804 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:42,804 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:37:42,805 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,805 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2023-10-12 17:37:42,807 INFO L201 PluginConnector]: Adding new model unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:42 BoogieIcfgContainer [2023-10-12 17:37:42,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:42,808 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:42,808 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:42,811 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:42,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:42,812 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:42" (1/2) ... [2023-10-12 17:37:42,813 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6adf0174 and model type unroll-5.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,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:42,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:42" (2/2) ... [2023-10-12 17:37:42,815 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-5.wvr.bpl [2023-10-12 17:37:42,858 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 50 flow [2023-10-12 17:37:42,917 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2023-10-12 17:37:42,917 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:42,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 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/10 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2023-10-12 17:37:42,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 17 transitions, 50 flow [2023-10-12 17:37:42,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:42,927 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:42,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:42,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:42,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:42,948 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2023-10-12 17:37:42,948 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:42,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 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/10 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2023-10-12 17:37:42,949 INFO L119 LiptonReduction]: Number of co-enabled transitions 16 [2023-10-12 17:37:42,980 INFO L134 LiptonReduction]: Checked pairs total: 18 [2023-10-12 17:37:42,980 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:37:42,992 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:42,993 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:42,993 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:42,993 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:42,993 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:42,993 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:42,993 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:42,994 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:42,994 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:37:43,004 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L54: Formula: (and (= v_i1_5 0) (= v_i1_5 v_i2_13) (= v_i1_5 v_x1_3) (= v_i1_5 v_x2_11)) InVars {i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} OutVars{i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} AuxVars[] AssignedVars[][8], 2:2A:[66] L54-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[61] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 (* v_n_13 5)) (= (select v_f_23 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_13, f=v_f_23} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_13, f=v_f_23} AuxVars[] AssignedVars[i1, x1][4]] [2023-10-12 17:37:43,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:43,007 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:43,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:43,007 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:43,010 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:43,010 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:37:43,011 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L54: Formula: (and (= v_i1_5 0) (= v_i1_5 v_i2_13) (= v_i1_5 v_x1_3) (= v_i1_5 v_x2_11)) InVars {i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} OutVars{i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} AuxVars[] AssignedVars[][8], 2:2A:[66] L54-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[61] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 (* v_n_13 5)) (= (select v_f_23 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_13, f=v_f_23} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_13, f=v_f_23} AuxVars[] AssignedVars[i1, x1][4]] [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,017 INFO L748 eck$LassoCheckResult]: Stem: 24#[$Ultimate##0]true [57] $Ultimate##0-->L54: Formula: (and (= v_i1_5 0) (= v_i1_5 v_i2_13) (= v_i1_5 v_x1_3) (= v_i1_5 v_x2_11)) InVars {i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} OutVars{i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} AuxVars[] AssignedVars[] 26#[L54]true [66] L54-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L54-1, L20]true [2023-10-12 17:37:43,017 INFO L750 eck$LassoCheckResult]: Loop: 28#[L54-1, L20]true [61] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 (* v_n_13 5)) (= (select v_f_23 v_x1_10) v_x1_9)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_13, f=v_f_23} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_13, f=v_f_23} AuxVars[] AssignedVars[i1, x1] 28#[L54-1, L20]true [2023-10-12 17:37:43,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2794, now seen corresponding path program 1 times [2023-10-12 17:37:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024566878] [2023-10-12 17:37:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2023-10-12 17:37:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184673484] [2023-10-12 17:37:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash 86675, now seen corresponding path program 1 times [2023-10-12 17:37:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163882320] [2023-10-12 17:37:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,250 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:43,251 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:43,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:43,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:43,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:43,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:43,251 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:43,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-5.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:43,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:43,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:43,265 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,278 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,282 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,295 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,299 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,369 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:43,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,381 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,386 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,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:43,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:43,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:43,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:43,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:43,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [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,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:43,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:43,441 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:43,446 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,449 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,449 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:43,468 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:43,469 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:43,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i1) = 5*n - 1*i1 Supporting invariants [] [2023-10-12 17:37:43,480 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,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:43,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:43,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:43,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:43,556 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:43,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:43,558 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,599 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,658 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,665 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,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2023-10-12 17:37:43,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:43,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:43,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:43,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:43,674 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:37:43,674 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:43,674 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:37:43,677 ERROR L47 etriNetUnfolderRabin]: [1:1A:[57] $Ultimate##0-->L54: Formula: (and (= v_i1_5 0) (= v_i1_5 v_i2_13) (= v_i1_5 v_x1_3) (= v_i1_5 v_x2_11)) InVars {i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} OutVars{i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} AuxVars[] AssignedVars[][34], 2:2A:[66] L54-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2], 4:3A:[69] L54-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][11]][5:4A:[63] L33-->L33: Formula: (and (< v_i2_60 (* v_n_17 5)) (= v_i2_58 (+ 5 v_i2_60)) (= (select v_f_29 (select v_f_29 (select v_f_29 (select v_f_29 (select v_f_29 v_x2_58))))) v_x2_57)) InVars {i2=v_i2_60, n=v_n_17, f=v_f_29, x2=v_x2_58} OutVars{i2=v_i2_58, n=v_n_17, f=v_f_29, x2=v_x2_57} AuxVars[] AssignedVars[x2, i2][29]] [2023-10-12 17:37:43,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:43,679 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:37:43,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:43,679 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:43,680 INFO L748 eck$LassoCheckResult]: Stem: 24#[$Ultimate##0]true [57] $Ultimate##0-->L54: Formula: (and (= v_i1_5 0) (= v_i1_5 v_i2_13) (= v_i1_5 v_x1_3) (= v_i1_5 v_x2_11)) InVars {i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} OutVars{i1=v_i1_5, i2=v_i2_13, x1=v_x1_3, x2=v_x2_11} AuxVars[] AssignedVars[] 26#[L54]true [66] L54-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L54-1, L20]true [69] L54-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] 63#[L33, L20, L55]true [2023-10-12 17:37:43,681 INFO L750 eck$LassoCheckResult]: Loop: 63#[L33, L20, L55]true [63] L33-->L33: Formula: (and (< v_i2_60 (* v_n_17 5)) (= v_i2_58 (+ 5 v_i2_60)) (= (select v_f_29 (select v_f_29 (select v_f_29 (select v_f_29 (select v_f_29 v_x2_58))))) v_x2_57)) InVars {i2=v_i2_60, n=v_n_17, f=v_f_29, x2=v_x2_58} OutVars{i2=v_i2_58, n=v_n_17, f=v_f_29, x2=v_x2_57} AuxVars[] AssignedVars[x2, i2] 63#[L33, L20, L55]true [2023-10-12 17:37:43,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 86683, now seen corresponding path program 1 times [2023-10-12 17:37:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547418430] [2023-10-12 17:37:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 94, now seen corresponding path program 1 times [2023-10-12 17:37:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694761441] [2023-10-12 17:37:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2687236, now seen corresponding path program 1 times [2023-10-12 17:37:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766299751] [2023-10-12 17:37:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:43,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:43,840 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:43,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:43,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:43,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:43,841 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:43,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:43,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:43,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:43,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-5.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:43,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:43,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:43,843 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:43,846 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,854 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,858 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:43,862 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,931 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,935 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:44,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:44,025 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:44,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,029 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:44,040 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,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,057 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:44,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:44,076 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:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:44,129 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,131 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,132 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,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:44,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:44,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:44,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:44,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:44,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:44,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:44,169 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:37:44,169 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [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,172 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,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:44,185 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,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:44,201 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:44,201 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 5*n Supporting invariants [] [2023-10-12 17:37:44,209 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,211 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:44,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:44,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:44,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:44,246 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:44,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:44,247 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,248 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,290 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,291 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,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2023-10-12 17:37:44,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:44,294 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 176 transitions, 1248 flow [2023-10-12 17:37:44,295 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:44,295 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 176 transitions, 1248 flow [2023-10-12 17:37:44,309 INFO L124 PetriNetUnfolderBase]: 16/32 cut-off events. [2023-10-12 17:37:44,309 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:37:44,309 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:44,316 INFO L201 PluginConnector]: Adding new model unroll-5.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:44 BoogieIcfgContainer [2023-10-12 17:37:44,316 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:44,321 INFO L158 Benchmark]: Toolchain (without parser) took 1810.44ms. Allocated memory was 188.7MB in the beginning and 284.2MB in the end (delta: 95.4MB). Free memory was 142.1MB in the beginning and 196.2MB in the end (delta: -54.1MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,322 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:44,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.96ms. Allocated memory is still 188.7MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,323 INFO L158 Benchmark]: Boogie Preprocessor took 14.68ms. Allocated memory is still 188.7MB. Free memory was 140.5MB in the beginning and 139.6MB in the end (delta: 979.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,324 INFO L158 Benchmark]: RCFGBuilder took 254.42ms. Allocated memory is still 188.7MB. Free memory was 139.4MB in the beginning and 127.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,324 INFO L158 Benchmark]: BuchiAutomizer took 1508.45ms. Allocated memory was 188.7MB in the beginning and 284.2MB in the end (delta: 95.4MB). Free memory was 126.9MB in the beginning and 196.2MB in the end (delta: -69.3MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:44,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.96ms. Allocated memory is still 188.7MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.68ms. Allocated memory is still 188.7MB. Free memory was 140.5MB in the beginning and 139.6MB in the end (delta: 979.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.42ms. Allocated memory is still 188.7MB. Free memory was 139.4MB in the beginning and 127.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1508.45ms. Allocated memory was 188.7MB in the beginning and 284.2MB in the end (delta: 95.4MB). Free memory was 126.9MB in the beginning and 196.2MB in the end (delta: -69.3MB). Peak memory consumption was 26.1MB. 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 5 * n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + 5 * n and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 30 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital39 mio100 ax100 hnf100 lsp39 ukn93 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 95ms 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.0s, 18 PlacesBefore, 16 PlacesAfterwards, 13 TransitionsBefore, 11 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , 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,360 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,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:37:44,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...