/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/POPL2023/sum-print2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:19,209 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:19,249 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:19,264 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:19,265 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:19,265 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:19,266 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:19,266 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:19,266 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:19,266 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:19,267 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:19,267 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:19,267 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:19,267 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:19,267 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:19,268 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:19,268 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:19,268 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:19,268 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:19,269 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:19,269 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:19,269 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:19,269 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:19,270 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:19,270 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:19,270 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:19,270 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:19,270 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:19,271 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:19,271 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:19,271 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:19,271 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:19,271 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:19,272 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:19,272 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:19,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:19,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:19,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:19,479 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:19,479 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:19,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl [2023-10-12 17:37:19,481 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl' [2023-10-12 17:37:19,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:19,506 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:19,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:19,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:19,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:19,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,530 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:19,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:19,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:19,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:19,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:19,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:19,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:19,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:19,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:19,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/1) ... [2023-10-12 17:37:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:19,573 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:19,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:19,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T4 given in one single declaration [2023-10-12 17:37:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure T4 [2023-10-12 17:37:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure T4 [2023-10-12 17:37:19,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:19,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2023-10-12 17:37:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2023-10-12 17:37:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2023-10-12 17:37:19,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T3 given in one single declaration [2023-10-12 17:37:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure T3 [2023-10-12 17:37:19,608 INFO L138 BoogieDeclarations]: Found implementation of procedure T3 [2023-10-12 17:37:19,608 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:19,643 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:19,644 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:19,717 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:19,732 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:19,732 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:37:19,735 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T2EXIT is neither atomic block end nor error location. [2023-10-12 17:37:19,736 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T3EXIT is neither atomic block end nor error location. [2023-10-12 17:37:19,737 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:19 BoogieIcfgContainer [2023-10-12 17:37:19,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:19,738 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:19,738 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:19,741 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:19,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:19,742 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:19" (1/2) ... [2023-10-12 17:37:19,742 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed114df and model type sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:19, skipping insertion in model container [2023-10-12 17:37:19,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:19,743 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:19" (2/2) ... [2023-10-12 17:37:19,744 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-print2.bpl [2023-10-12 17:37:19,820 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:37:19,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:37:19,854 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:37:19,854 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:19,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:37:19,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:37:19,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:37:19,862 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:19,872 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:37:19,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:37:19,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:37:19,882 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:37:19,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:37:19,883 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:37:20,174 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:37:20,175 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:37:20,184 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:20,184 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:20,184 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:20,185 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:20,185 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:20,185 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:20,185 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:20,185 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:20,185 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 16 transitions, 50 flow [2023-10-12 17:37:20,187 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x][14], 2:2A:[90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0][11]][3:3A:[85] L25-->L25: Formula: (and (= (+ v_x_17 (select v_A_9 v_i_21)) v_x_16) (= v_i_20 (+ v_i_21 1)) (< v_i_21 v_N_9)) InVars {A=v_A_9, i=v_i_21, x=v_x_17, N=v_N_9} OutVars{A=v_A_9, i=v_i_20, x=v_x_16, N=v_N_9} AuxVars[] AssignedVars[i, x][8]] [2023-10-12 17:37:20,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:20,189 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:20,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:20,189 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:20,191 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:20,191 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 16 transitions, 50 flow [2023-10-12 17:37:20,192 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x][14], 2:2A:[90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0][11]][3:3A:[85] L25-->L25: Formula: (and (= (+ v_x_17 (select v_A_9 v_i_21)) v_x_16) (= v_i_20 (+ v_i_21 1)) (< v_i_21 v_N_9)) InVars {A=v_A_9, i=v_i_21, x=v_x_17, N=v_N_9} OutVars{A=v_A_9, i=v_i_20, x=v_x_16, N=v_N_9} AuxVars[] AssignedVars[i, x][8]] [2023-10-12 17:37:20,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:20,192 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:20,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:20,192 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:20,195 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x] 41#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 43#[L25, L76-1]true [2023-10-12 17:37:20,195 INFO L750 eck$LassoCheckResult]: Loop: 43#[L25, L76-1]true [85] L25-->L25: Formula: (and (= (+ v_x_17 (select v_A_9 v_i_21)) v_x_16) (= v_i_20 (+ v_i_21 1)) (< v_i_21 v_N_9)) InVars {A=v_A_9, i=v_i_21, x=v_x_17, N=v_N_9} OutVars{A=v_A_9, i=v_i_20, x=v_x_16, N=v_N_9} AuxVars[] AssignedVars[i, x] 43#[L25, L76-1]true [2023-10-12 17:37:20,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash 4399, now seen corresponding path program 1 times [2023-10-12 17:37:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744480557] [2023-10-12 17:37:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2023-10-12 17:37:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627670930] [2023-10-12 17:37:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash 136454, now seen corresponding path program 1 times [2023-10-12 17:37:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107420990] [2023-10-12 17:37:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,410 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:20,411 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:20,411 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:20,411 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:20,411 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:20,411 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:20,411 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:20,411 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:20,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:20,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:20,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:20,426 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:20,445 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:20,448 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:20,463 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:20,517 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:20,520 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:20,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:20,523 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:20,528 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:20,529 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:20,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:20,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:20,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:20,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:20,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:20,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:20,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:20,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:37:20,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:20,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:20,566 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:20,567 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:20,569 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:20,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:20,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:20,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:20,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:20,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:20,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:20,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:20,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:20,602 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:20,610 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:20,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:20,632 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:20,632 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:20,632 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:37:20,636 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:20,636 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:20,639 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:20,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:20,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:20,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:20,689 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:20,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:20,690 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:20,724 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:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:20,817 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:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-10-12 17:37:20,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:20,825 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 64 transitions, 328 flow [2023-10-12 17:37:20,825 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:20,825 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 64 transitions, 328 flow [2023-10-12 17:37:20,837 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x][59], 2:2A:[90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0][47], 4:3A:[93] L76-1-->L38: Formula: (and (= v_T3Thread1of1ForFork1_thidvar1_2 3) (= v_T3Thread1of1ForFork1_thidvar2_2 3) (= v_T3Thread1of1ForFork1_thidvar0_2 3)) InVars {} OutVars{T3Thread1of1ForFork1_thidvar1=v_T3Thread1of1ForFork1_thidvar1_2, T3Thread1of1ForFork1_thidvar2=v_T3Thread1of1ForFork1_thidvar2_2, T3Thread1of1ForFork1_thidvar0=v_T3Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T3Thread1of1ForFork1_thidvar1, T3Thread1of1ForFork1_thidvar2, T3Thread1of1ForFork1_thidvar0][22], 15:4A:[96] L77-->$Ultimate##0: Formula: (and (= v_T4Thread1of1ForFork2_thidvar1_2 4) (= v_T4Thread1of1ForFork2_thidvar2_2 4) (= v_T4Thread1of1ForFork2_thidvar3_2 4) (= v_T4Thread1of1ForFork2_thidvar0_2 4)) InVars {} OutVars{T4Thread1of1ForFork2_thidvar2=v_T4Thread1of1ForFork2_thidvar2_2, T4Thread1of1ForFork2_thidvar1=v_T4Thread1of1ForFork2_thidvar1_2, T4Thread1of1ForFork2_thidvar3=v_T4Thread1of1ForFork2_thidvar3_2, T4Thread1of1ForFork2_thidvar0=v_T4Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[T4Thread1of1ForFork2_thidvar2, T4Thread1of1ForFork2_thidvar1, T4Thread1of1ForFork2_thidvar3, T4Thread1of1ForFork2_thidvar0][13], 40:5A:[74] $Ultimate##0-->L54-2: Formula: (= v_k_1 0) InVars {} OutVars{k=v_k_1} AuxVars[] AssignedVars[k][25]][44:6A:[111] L54-2-->L54-2: Formula: (let ((.cse0 (select v_A_In_1 v_k_In_1)) (.cse1 (+ v_k_In_1 1))) (or (and (= (+ .cse0 v_y_In_1) v_y_Out_2) (<= v_N_In_1 v_k_Out_2) (< v_k_In_1 v_N_In_1) (= v_k_Out_2 .cse1)) (and (= v_k_Out_2 (+ 2 v_k_In_1)) (= v_y_Out_2 (+ .cse0 (select v_A_In_1 .cse1) v_y_In_1)) (< .cse1 v_N_In_1)))) InVars {A=v_A_In_1, y=v_y_In_1, N=v_N_In_1, k=v_k_In_1} OutVars{A=v_A_In_1, y=v_y_Out_2, N=v_N_In_1, k=v_k_Out_2} AuxVars[] AssignedVars[k, y][61]] [2023-10-12 17:37:20,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:20,838 INFO L124 PetriNetUnfolderBase]: 28/43 cut-off events. [2023-10-12 17:37:20,838 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:37:20,838 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:20,839 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x] 41#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 43#[L25, L76-1]true [93] L76-1-->L38: Formula: (and (= v_T3Thread1of1ForFork1_thidvar1_2 3) (= v_T3Thread1of1ForFork1_thidvar2_2 3) (= v_T3Thread1of1ForFork1_thidvar0_2 3)) InVars {} OutVars{T3Thread1of1ForFork1_thidvar1=v_T3Thread1of1ForFork1_thidvar1_2, T3Thread1of1ForFork1_thidvar2=v_T3Thread1of1ForFork1_thidvar2_2, T3Thread1of1ForFork1_thidvar0=v_T3Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T3Thread1of1ForFork1_thidvar1, T3Thread1of1ForFork1_thidvar2, T3Thread1of1ForFork1_thidvar0] 79#[L25, L38, L77]true [96] L77-->$Ultimate##0: Formula: (and (= v_T4Thread1of1ForFork2_thidvar1_2 4) (= v_T4Thread1of1ForFork2_thidvar2_2 4) (= v_T4Thread1of1ForFork2_thidvar3_2 4) (= v_T4Thread1of1ForFork2_thidvar0_2 4)) InVars {} OutVars{T4Thread1of1ForFork2_thidvar2=v_T4Thread1of1ForFork2_thidvar2_2, T4Thread1of1ForFork2_thidvar1=v_T4Thread1of1ForFork2_thidvar1_2, T4Thread1of1ForFork2_thidvar3=v_T4Thread1of1ForFork2_thidvar3_2, T4Thread1of1ForFork2_thidvar0=v_T4Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[T4Thread1of1ForFork2_thidvar2, T4Thread1of1ForFork2_thidvar1, T4Thread1of1ForFork2_thidvar3, T4Thread1of1ForFork2_thidvar0] 81#[$Ultimate##0, L78, L25, L38]true [74] $Ultimate##0-->L54-2: Formula: (= v_k_1 0) InVars {} OutVars{k=v_k_1} AuxVars[] AssignedVars[k] 83#[L54-2, L78, L25, L38]true [2023-10-12 17:37:20,840 INFO L750 eck$LassoCheckResult]: Loop: 83#[L54-2, L78, L25, L38]true [111] L54-2-->L54-2: Formula: (let ((.cse0 (select v_A_In_1 v_k_In_1)) (.cse1 (+ v_k_In_1 1))) (or (and (= (+ .cse0 v_y_In_1) v_y_Out_2) (<= v_N_In_1 v_k_Out_2) (< v_k_In_1 v_N_In_1) (= v_k_Out_2 .cse1)) (and (= v_k_Out_2 (+ 2 v_k_In_1)) (= v_y_Out_2 (+ .cse0 (select v_A_In_1 .cse1) v_y_In_1)) (< .cse1 v_N_In_1)))) InVars {A=v_A_In_1, y=v_y_In_1, N=v_N_In_1, k=v_k_In_1} OutVars{A=v_A_In_1, y=v_y_Out_2, N=v_N_In_1, k=v_k_Out_2} AuxVars[] AssignedVars[k, y] 83#[L54-2, L78, L25, L38]true [2023-10-12 17:37:20,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 131143032, now seen corresponding path program 1 times [2023-10-12 17:37:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990366343] [2023-10-12 17:37:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 142, now seen corresponding path program 1 times [2023-10-12 17:37:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432387889] [2023-10-12 17:37:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:20,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -229533193, now seen corresponding path program 1 times [2023-10-12 17:37:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068551288] [2023-10-12 17:37:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:20,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:21,082 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:21,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:21,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:21,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:21,083 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:21,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:21,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:21,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:21,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:21,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:21,088 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:21,092 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:21,095 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:21,171 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:21,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:21,185 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:21,187 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:21,189 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:21,192 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:21,194 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:21,196 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:21,199 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:21,355 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:21,355 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,356 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:21,358 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:21,361 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:21,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,391 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:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,393 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:21,395 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:21,396 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:21,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:21,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:21,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:21,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:21,440 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:21,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,441 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:21,443 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:21,444 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:21,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:21,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:21,450 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:21,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:21,464 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:21,464 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:21,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:21,515 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:21,530 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:37:21,530 INFO L444 ModelExtractionUtils]: 22 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:37:21,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:21,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:21,531 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:21,534 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:21,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:21,558 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:37:21,558 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:21,558 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:37:21,566 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:21,569 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:37:21,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:21,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:21,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:21,596 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:37:21,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:21,596 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:21,596 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:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2023-10-12 17:37:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:21,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:21,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:21,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:21,685 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 256 transitions, 1824 flow [2023-10-12 17:37:21,685 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:21,685 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 256 transitions, 1824 flow [2023-10-12 17:37:21,717 INFO L124 PetriNetUnfolderBase]: 106/158 cut-off events. [2023-10-12 17:37:21,717 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:37:21,717 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:21,721 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:21 BoogieIcfgContainer [2023-10-12 17:37:21,721 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:21,722 INFO L158 Benchmark]: Toolchain (without parser) took 2216.03ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 139.3MB in the beginning and 261.0MB in the end (delta: -121.7MB). Peak memory consumption was 26.7kB. Max. memory is 8.0GB. [2023-10-12 17:37:21,722 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:21,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.39ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,723 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 188.7MB. Free memory was 137.8MB in the beginning and 136.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,723 INFO L158 Benchmark]: RCFGBuilder took 188.16ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 126.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:21,723 INFO L158 Benchmark]: BuchiAutomizer took 1983.28ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 126.0MB in the beginning and 261.0MB in the end (delta: -135.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:21,725 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 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.39ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 188.7MB. Free memory was 137.8MB in the beginning and 136.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 188.16ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 126.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1983.28ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 126.0MB in the beginning and 261.0MB in the end (delta: -135.0MB). There was no memory consumed. 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 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.1s. 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, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 80 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp133 ukn65 mio100 lsp78 div100 bol100 ite100 ukn100 eq180 hnf96 smp100 dnf118 smp70 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 118ms VariablesStem: 2 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.3s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 16 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 12 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 70, independent: 70, independent conditional: 0, independent unconditional: 70, 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: 70, independent: 70, independent conditional: 0, independent unconditional: 70, 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: 146, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, 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:21,745 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:21,942 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...