/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/popl20-more/sum-array-hom.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:43,441 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:43,493 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:40:43,518 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:43,518 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:43,519 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:43,520 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:43,520 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:43,520 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:43,520 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:43,521 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:43,521 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:43,521 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:43,521 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:43,522 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:43,522 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:43,522 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:43,522 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:43,522 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:43,523 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:43,523 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:43,526 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:43,526 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:43,527 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:43,527 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:43,527 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:43,528 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:43,528 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:43,528 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:43,528 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:43,528 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:43,529 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:43,529 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:43,530 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:43,530 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:40:43,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:43,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:43,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:43,756 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:43,757 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:43,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array-hom.wvr.bpl [2023-10-12 17:40:43,759 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array-hom.wvr.bpl' [2023-10-12 17:40:43,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:43,784 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:43,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:43,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:43,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:43,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,806 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:43,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:43,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:43,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:43,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:43,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:43,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:43,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:43,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:43,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,841 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:40:43,846 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:40:43,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:43,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:43,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:43,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:43,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:43,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:43,877 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:40:43,914 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:43,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:43,992 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:44,004 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:44,004 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:44,014 INFO L201 PluginConnector]: Adding new model sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:44 BoogieIcfgContainer [2023-10-12 17:40:44,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:44,015 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:44,015 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:44,020 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:44,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:44,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/2) ... [2023-10-12 17:40:44,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9e5edac and model type sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:44, skipping insertion in model container [2023-10-12 17:40:44,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:44,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:44" (2/2) ... [2023-10-12 17:40:44,024 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-array-hom.wvr.bpl [2023-10-12 17:40:44,094 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:44,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:44,127 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:44,127 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:44,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:44,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:44,135 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:44,145 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:44,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:44,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:44,166 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:44,166 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:44,167 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:40:44,441 INFO L134 LiptonReduction]: Checked pairs total: 124 [2023-10-12 17:40:44,441 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:40:44,452 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:44,453 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:44,453 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:44,453 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:44,453 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:44,453 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:44,453 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:44,454 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:44,454 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:44,458 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i][10]] [2023-10-12 17:40:44,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:44,460 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:44,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:44,462 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:44,467 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:44,467 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:44,468 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i][10]] [2023-10-12 17:40:44,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:44,469 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:44,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:44,469 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:44,473 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [2023-10-12 17:40:44,476 INFO L750 eck$LassoCheckResult]: Loop: 44#[L23-1, L59-1]true [96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i] 44#[L23-1, L59-1]true [2023-10-12 17:40:44,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:40:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202897624] [2023-10-12 17:40:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2023-10-12 17:40:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157818798] [2023-10-12 17:40:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 130420, now seen corresponding path program 1 times [2023-10-12 17:40:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350823494] [2023-10-12 17:40:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,757 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:44,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:44,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:44,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:44,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:44,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:44,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:44,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array-hom.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:44,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:44,758 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:44,769 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:40:44,796 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:40:44,798 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:40:44,802 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:40:44,805 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:40:44,874 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:44,877 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,880 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:40:44,919 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:40:44,920 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:40:44,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:44,973 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:44,973 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:44,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,977 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:40:44,979 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:40:44,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:45,001 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:45,002 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:45,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:45,021 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:40:45,024 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:45,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,067 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,068 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:40:45,101 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:40:45,198 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:40:45,203 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:40:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:45,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:45,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:45,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:45,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,212 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:45,212 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:45,212 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:45,215 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][56], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 4:3A:[84] L59-1-->L34-1: 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][14]][5:4A:[94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_10 v_j_16) v_sum2_12) v_sum2_11) (< v_j_16 v_M_10)) InVars {A=v_A_10, sum2=v_sum2_12, M=v_M_10, j=v_j_16} OutVars{A=v_A_10, sum2=v_sum2_11, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j][51]] [2023-10-12 17:40:45,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,216 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:45,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:45,216 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,217 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: 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] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:45,217 INFO L750 eck$LassoCheckResult]: Loop: 79#[L23-1, L60, L34-1]true [94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_10 v_j_16) v_sum2_12) v_sum2_11) (< v_j_16 v_M_10)) InVars {A=v_A_10, sum2=v_sum2_12, M=v_M_10, j=v_j_16} OutVars{A=v_A_10, sum2=v_sum2_11, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:45,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:40:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924012170] [2023-10-12 17:40:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 125, now seen corresponding path program 1 times [2023-10-12 17:40:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129921245] [2023-10-12 17:40:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 4042742, now seen corresponding path program 1 times [2023-10-12 17:40:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953293944] [2023-10-12 17:40:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,371 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:45,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:45,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:45,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:45,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:45,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:45,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:45,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array-hom.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:45,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:45,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:45,374 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:40:45,389 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:40:45,392 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:40:45,394 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:40:45,397 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:40:45,399 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:40:45,402 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:40:45,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:45,485 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,493 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:40:45,496 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:40:45,497 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:40:45,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:45,547 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:40:45,547 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:45,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,591 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:40:45,592 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:40:45,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:45,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:45,608 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:45,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:40:45,613 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:40:45,615 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:45,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,657 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,658 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:40:45,659 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:40:45,735 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:40:45,736 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:40:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,740 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:45,740 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:45,740 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:45,742 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][225], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[84] L59-1-->L34-1: 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][57], 7:4A:[87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][95]][8:5A:[99] L45-1-->L45-1: Formula: (and (= v_k_13 (+ v_k_14 1)) (= (+ (select v_A_14 v_k_14) v_sum3_14) v_sum3_13) (< v_k_14 v_N_14)) InVars {A=v_A_14, sum3=v_sum3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, sum3=v_sum3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[sum3, k][110]] [2023-10-12 17:40:45,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,743 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:40:45,743 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:45,743 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,743 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: 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] 79#[L23-1, L60, L34-1]true [87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:45,743 INFO L750 eck$LassoCheckResult]: Loop: 113#[L23-1, L61, L34-1, L45-1]true [99] L45-1-->L45-1: Formula: (and (= v_k_13 (+ v_k_14 1)) (= (+ (select v_A_14 v_k_14) v_sum3_14) v_sum3_13) (< v_k_14 v_N_14)) InVars {A=v_A_14, sum3=v_sum3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, sum3=v_sum3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[sum3, k] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:45,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 4042735, now seen corresponding path program 1 times [2023-10-12 17:40:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304557003] [2023-10-12 17:40:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:40:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870420985] [2023-10-12 17:40:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 125324884, now seen corresponding path program 1 times [2023-10-12 17:40:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714074683] [2023-10-12 17:40:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,845 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:40:45,863 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:40:45,911 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:45,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:45,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:45,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:45,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:45,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:45,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:45,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array-hom.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:45,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:45,917 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:45,924 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:40:45,927 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:40:45,929 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:40:45,942 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:40:45,944 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:40:45,946 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:40:45,948 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:40:45,950 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:40:45,953 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:40:45,955 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:40:45,958 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:40:46,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:46,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:46,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,050 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:40:46,052 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:40:46,054 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:40:46,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:40:46,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,101 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:40:46,103 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:40:46,105 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:40:46,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,128 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:40:46,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,135 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:40:46,136 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:40:46,138 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:40:46,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:46,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:40:46,183 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:40:46,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,226 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:40:46,226 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:40:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:40:46,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:46,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:46,269 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:46,269 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:40:46,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,276 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:46,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,304 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,305 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:40:46,306 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:40:46,360 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:40:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:40:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:46,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:46,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:46,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:46,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,362 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:46,362 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:46,363 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:46,408 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:40:46,408 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:40:46,409 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:46,415 INFO L201 PluginConnector]: Adding new model sum-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:46 BoogieIcfgContainer [2023-10-12 17:40:46,415 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:46,416 INFO L158 Benchmark]: Toolchain (without parser) took 2631.59ms. Allocated memory was 211.8MB in the beginning and 298.8MB in the end (delta: 87.0MB). Free memory was 163.6MB in the beginning and 219.7MB in the end (delta: -56.0MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2023-10-12 17:40:46,416 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.48ms. Allocated memory is still 211.8MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:46,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.18ms. Allocated memory is still 211.8MB. Free memory was 163.6MB in the beginning and 162.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:46,420 INFO L158 Benchmark]: Boogie Preprocessor took 12.00ms. Allocated memory is still 211.8MB. Free memory was 162.1MB in the beginning and 161.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:46,420 INFO L158 Benchmark]: RCFGBuilder took 193.19ms. Allocated memory is still 211.8MB. Free memory was 160.9MB in the beginning and 150.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:46,421 INFO L158 Benchmark]: BuchiAutomizer took 2400.57ms. Allocated memory was 211.8MB in the beginning and 298.8MB in the end (delta: 87.0MB). Free memory was 150.8MB in the beginning and 219.7MB in the end (delta: -68.9MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:46,427 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.48ms. Allocated memory is still 211.8MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.18ms. Allocated memory is still 211.8MB. Free memory was 163.6MB in the beginning and 162.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.00ms. Allocated memory is still 211.8MB. Free memory was 162.1MB in the beginning and 161.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.19ms. Allocated memory is still 211.8MB. Free memory was 160.9MB in the beginning and 150.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2400.57ms. Allocated memory was 211.8MB in the beginning and 298.8MB in the end (delta: 87.0MB). Free memory was 150.8MB in the beginning and 219.7MB in the end (delta: -68.9MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 114 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp61 ukn93 mio100 lsp72 div100 bol100 ite100 ukn100 eq159 hnf92 smp100 dnf100 smp100 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 124ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 124, independent conditional: 0, independent unconditional: 124, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 124, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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:40:46,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...