/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/array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:39:00,630 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:39:00,693 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:39:00,718 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:39:00,719 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:39:00,719 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:39:00,720 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:39:00,721 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:39:00,721 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:39:00,724 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:39:00,724 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:39:00,724 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:39:00,724 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:39:00,725 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:39:00,726 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:39:00,726 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:39:00,726 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:39:00,726 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:39:00,727 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:39:00,727 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:39:00,727 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:39:00,728 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:39:00,728 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:39:00,728 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:39:00,728 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:39:00,729 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:39:00,729 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:39:00,729 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:39:00,729 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:39:00,729 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:39:00,730 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:39:00,730 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:39:00,730 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:39:00,731 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:39:00,732 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:39:00,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:39:00,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:39:00,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:39:00,940 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:39:00,943 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:39:00,944 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/array-sum.wvr.bpl [2023-10-12 17:39:00,944 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum.wvr.bpl' [2023-10-12 17:39:00,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:39:00,969 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:39:00,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:00,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:39:00,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:39:00,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:00,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:00,991 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:39:00,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:00,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:39:00,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:39:00,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:39:01,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:39:01,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:39:01,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:39:01,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:39:01,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/1) ... [2023-10-12 17:39:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,040 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:39:01,079 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:39:01,097 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:39:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:39:01,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:39:01,097 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:39:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:39:01,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:39:01,097 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:39:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:39:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:39:01,098 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:39:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:39:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:39:01,099 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:39:01,133 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:39:01,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:39:01,254 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:39:01,259 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:39:01,259 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:39:01,260 INFO L201 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:39:01 BoogieIcfgContainer [2023-10-12 17:39:01,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:39:01,261 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:39:01,261 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:39:01,265 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:39:01,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:01,266 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:00" (1/2) ... [2023-10-12 17:39:01,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1072d2c9 and model type array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:39:01, skipping insertion in model container [2023-10-12 17:39:01,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:01,268 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:39:01" (2/2) ... [2023-10-12 17:39:01,270 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum.wvr.bpl [2023-10-12 17:39:01,336 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:39:01,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:39:01,387 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:39:01,387 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:39:01,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:39:01,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:39:01,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:01,399 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:39:01,423 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:01,425 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:01,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:01,430 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:39:01,430 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:39:01,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:39:01,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:39:01,669 INFO L134 LiptonReduction]: Checked pairs total: 138 [2023-10-12 17:39:01,669 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:39:01,678 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:39:01,678 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:39:01,678 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:39:01,678 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:39:01,678 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:39:01,678 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:39:01,678 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:39:01,678 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:39:01,679 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:39:01,681 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[][11], 2:2A:[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5]][3:3A:[107] L22-->L22: Formula: (and (= (+ (select v_A_18 v_i_14) v_res1_16 (select v_B_18 v_i_14)) v_res1_15) (< v_i_14 v_N_16) (= v_i_13 (+ v_i_14 1))) InVars {A=v_A_18, N=v_N_16, res1=v_res1_16, i=v_i_14, B=v_B_18} OutVars{A=v_A_18, N=v_N_16, res1=v_res1_15, i=v_i_13, B=v_B_18} AuxVars[] AssignedVars[res1, i][12]] [2023-10-12 17:39:01,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:01,682 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:01,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:01,682 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:01,684 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:39:01,684 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:39:01,685 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[][11], 2:2A:[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5]][3:3A:[107] L22-->L22: Formula: (and (= (+ (select v_A_18 v_i_14) v_res1_16 (select v_B_18 v_i_14)) v_res1_15) (< v_i_14 v_N_16) (= v_i_13 (+ v_i_14 1))) InVars {A=v_A_18, N=v_N_16, res1=v_res1_16, i=v_i_14, B=v_B_18} OutVars{A=v_A_18, N=v_N_16, res1=v_res1_15, i=v_i_13, B=v_B_18} AuxVars[] AssignedVars[res1, i][12]] [2023-10-12 17:39:01,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:01,685 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:01,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:01,685 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:01,688 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L53]true [84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L53-1, L22]true [2023-10-12 17:39:01,689 INFO L750 eck$LassoCheckResult]: Loop: 47#[L53-1, L22]true [107] L22-->L22: Formula: (and (= (+ (select v_A_18 v_i_14) v_res1_16 (select v_B_18 v_i_14)) v_res1_15) (< v_i_14 v_N_16) (= v_i_13 (+ v_i_14 1))) InVars {A=v_A_18, N=v_N_16, res1=v_res1_16, i=v_i_14, B=v_B_18} OutVars{A=v_A_18, N=v_N_16, res1=v_res1_15, i=v_i_13, B=v_B_18} AuxVars[] AssignedVars[res1, i] 47#[L53-1, L22]true [2023-10-12 17:39:01,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash 4393, now seen corresponding path program 1 times [2023-10-12 17:39:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036687890] [2023-10-12 17:39:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:39:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837994083] [2023-10-12 17:39:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 136290, now seen corresponding path program 1 times [2023-10-12 17:39:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007567766] [2023-10-12 17:39:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,938 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:01,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:01,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:01,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:01,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:01,939 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,939 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:01,939 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:01,939 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:39:01,939 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:01,939 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:01,951 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:39:01,976 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:39:01,979 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:39:01,981 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:39:02,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:02,051 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:02,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,065 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:39:02,074 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:39:02,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,099 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:39:02,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:02,139 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:39:02,139 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:39:02,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,153 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:39:02,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:02,186 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:39:02,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:02,188 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:02,189 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:39:02,193 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:39:02,196 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:02,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,239 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,240 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:39:02,258 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:39:02,322 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:39:02,325 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:39:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:02,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:39:02,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:39:02,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:39:02,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,329 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:39:02,329 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:39:02,329 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:39:02,331 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[][47], 2:2A:[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[87] L53-1-->L31: 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][18]][5:4A:[104] L31-->L31: Formula: (and (= v_j_19 (+ v_j_20 1)) (= (+ (select v_B_14 v_j_20) v_res2_34 (select v_A_14 v_j_20)) v_res2_33) (< v_j_20 v_M_12)) InVars {A=v_A_14, M=v_M_12, j=v_j_20, res2=v_res2_34, B=v_B_14} OutVars{A=v_A_14, M=v_M_12, j=v_j_19, res2=v_res2_33, B=v_B_14} AuxVars[] AssignedVars[j, res2][52]] [2023-10-12 17:39:02,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:02,331 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:39:02,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:02,331 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:02,331 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L53]true [84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L53-1, L22]true [87] L53-1-->L31: 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] 82#[L54, L31, L22]true [2023-10-12 17:39:02,331 INFO L750 eck$LassoCheckResult]: Loop: 82#[L54, L31, L22]true [104] L31-->L31: Formula: (and (= v_j_19 (+ v_j_20 1)) (= (+ (select v_B_14 v_j_20) v_res2_34 (select v_A_14 v_j_20)) v_res2_33) (< v_j_20 v_M_12)) InVars {A=v_A_14, M=v_M_12, j=v_j_20, res2=v_res2_34, B=v_B_14} OutVars{A=v_A_14, M=v_M_12, j=v_j_19, res2=v_res2_33, B=v_B_14} AuxVars[] AssignedVars[j, res2] 82#[L54, L31, L22]true [2023-10-12 17:39:02,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 136270, now seen corresponding path program 1 times [2023-10-12 17:39:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899738131] [2023-10-12 17:39:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 135, now seen corresponding path program 1 times [2023-10-12 17:39:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521080849] [2023-10-12 17:39:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash 4224474, now seen corresponding path program 1 times [2023-10-12 17:39:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669791694] [2023-10-12 17:39:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,415 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:02,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:02,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:02,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:02,415 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:02,415 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,415 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:02,415 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:02,415 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:39:02,415 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:02,416 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:02,416 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:39:02,419 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:39:02,421 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:39:02,423 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:39:02,425 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:39:02,437 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:39:02,503 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:02,504 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,518 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:39:02,519 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:39:02,521 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:39:02,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,546 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:39:02,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,547 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:39:02,551 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:39:02,552 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:39:02,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,572 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:39:02,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,573 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:39:02,577 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:39:02,578 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:39:02,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,609 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:39:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,611 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:39:02,629 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:39:02,630 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:39:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,658 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:39:02,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,660 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:39:02,662 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:39:02,663 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:39:02,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,693 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:39:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,694 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:39:02,709 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:39:02,709 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:39:02,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:02,741 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:39:02,741 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:02,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,744 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:39:02,773 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:02,782 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:39:02,791 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:02,791 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:02,791 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:39:02,807 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:39:02,808 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:02,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,831 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,831 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:39:02,832 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:39:02,928 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:39:02,934 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:39:02,935 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:39:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:39:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:39:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:39:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,938 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:39:02,939 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:39:02,939 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:39:02,942 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[][191], 2:2A:[84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][95], 4:3A:[87] L53-1-->L31: 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][75], 7:4A:[90] L54-->L40: 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][1]][8:5A:[105] L40-->L40: Formula: (and (= v_k_19 (+ v_k_20 1)) (< v_k_20 v_N_14) (= (+ (select v_B_16 v_k_20) (select v_A_16 v_k_20) v_res2_38) v_res2_37)) InVars {A=v_A_16, N=v_N_14, k=v_k_20, res2=v_res2_38, B=v_B_16} OutVars{A=v_A_16, N=v_N_14, k=v_k_19, res2=v_res2_37, B=v_B_16} AuxVars[] AssignedVars[k, res2][226]] [2023-10-12 17:39:02,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:02,943 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:39:02,943 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:39:02,943 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:02,943 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L53: Formula: (and (<= 0 v_M_14) (= v_i_17 v_res1_19) (= v_i_17 v_res2_41) (= v_i_17 v_j_23) (= v_M_14 v_k_23) (= v_i_17 0) (< v_M_14 v_N_18)) InVars {N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} OutVars{N=v_N_18, M=v_M_14, k=v_k_23, res1=v_res1_19, j=v_j_23, i=v_i_17, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L53]true [84] L53-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L53-1, L22]true [87] L53-1-->L31: 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] 82#[L54, L31, L22]true [90] L54-->L40: 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] 116#[L31, L22, L40, L55]true [2023-10-12 17:39:02,943 INFO L750 eck$LassoCheckResult]: Loop: 116#[L31, L22, L40, L55]true [105] L40-->L40: Formula: (and (= v_k_19 (+ v_k_20 1)) (< v_k_20 v_N_14) (= (+ (select v_B_16 v_k_20) (select v_A_16 v_k_20) v_res2_38) v_res2_37)) InVars {A=v_A_16, N=v_N_14, k=v_k_20, res2=v_res2_38, B=v_B_16} OutVars{A=v_A_16, N=v_N_14, k=v_k_19, res2=v_res2_37, B=v_B_16} AuxVars[] AssignedVars[k, res2] 116#[L31, L22, L40, L55]true [2023-10-12 17:39:02,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash 4224460, now seen corresponding path program 1 times [2023-10-12 17:39:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114874174] [2023-10-12 17:39:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,945 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:39:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:39:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329062005] [2023-10-12 17:39:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 130958365, now seen corresponding path program 1 times [2023-10-12 17:39:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399071438] [2023-10-12 17:39:02,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:03,063 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:03,063 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:03,063 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:03,063 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:03,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:03,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:03,064 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:03,064 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:39:03,064 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:03,064 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:03,065 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:39:03,067 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:03,069 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:39:03,081 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:39:03,083 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:39:03,085 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:39:03,087 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:39:03,089 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:39:03,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:39:03,094 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:39:03,179 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:03,180 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:03,190 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:03,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:39:03,196 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:39:03,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:03,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:03,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:03,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:03,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:03,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:03,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:03,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:03,265 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:03,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:39:03,298 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:39:03,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:03,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:03,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:03,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:03,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:03,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:03,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:03,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:03,336 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:03,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:39:03,340 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:39:03,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:03,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:03,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:03,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:03,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:03,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:03,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:03,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:03,469 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:03,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:39:03,473 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:39:03,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:03,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:03,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:03,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:03,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:03,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:03,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:03,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:39:03,511 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:03,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:03,525 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:03,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:03,563 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:03,564 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:03,564 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:39:03,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:39:03,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:39:03,567 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:03,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:03,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:03,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:03,589 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:03,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:03,590 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:39:03,590 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:39:03,644 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:39:03,645 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:39:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:03,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:39:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:39:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:39:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:03,646 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:39:03,646 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:39:03,646 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:39:03,668 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:39:03,668 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:39:03,668 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:39:03,672 INFO L201 PluginConnector]: Adding new model array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:39:03 BoogieIcfgContainer [2023-10-12 17:39:03,672 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:39:03,672 INFO L158 Benchmark]: Toolchain (without parser) took 2703.10ms. Allocated memory is still 199.2MB. Free memory was 157.7MB in the beginning and 120.4MB in the end (delta: 37.3MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2023-10-12 17:39:03,673 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 199.2MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:39:03,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.92ms. Allocated memory is still 199.2MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:03,673 INFO L158 Benchmark]: Boogie Preprocessor took 21.94ms. Allocated memory is still 199.2MB. Free memory was 156.2MB in the beginning and 155.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:03,674 INFO L158 Benchmark]: RCFGBuilder took 243.22ms. Allocated memory is still 199.2MB. Free memory was 155.0MB in the beginning and 145.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:39:03,674 INFO L158 Benchmark]: BuchiAutomizer took 2410.76ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 120.4MB in the end (delta: 24.7MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2023-10-12 17:39:03,675 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.26ms. Allocated memory is still 199.2MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.92ms. Allocated memory is still 199.2MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.94ms. Allocated memory is still 199.2MB. Free memory was 156.2MB in the beginning and 155.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.22ms. Allocated memory is still 199.2MB. Free memory was 155.0MB in the beginning and 145.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2410.76ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 120.4MB in the end (delta: 24.7MB). Peak memory consumption was 24.9MB. 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.6s. Construction of modules took 0.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 144 mSDtfsCounter, 216 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 lsp67 ukn88 mio100 lsp69 div100 bol100 ite100 ukn100 eq159 hnf92 smp100 dnf100 smp100 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 135ms 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.2s, 36 PlacesBefore, 22 PlacesAfterwards, 29 TransitionsBefore, 15 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 138, independent conditional: 0, independent unconditional: 138, 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: 120, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 120, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , 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:39:03,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:03,889 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...