/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 BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:32:12,060 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:32:12,118 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:32:12,141 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:32:12,141 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:32:12,141 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:32:12,142 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:32:12,142 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:32:12,143 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:32:12,145 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:32:12,146 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:32:12,146 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:32:12,146 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:32:12,147 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:32:12,147 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:32:12,147 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:32:12,147 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:32:12,147 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:32:12,147 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:32:12,148 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:32:12,148 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:32:12,149 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:32:12,150 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:32:12,150 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:32:12,150 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:32:12,151 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:32:12,151 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:32:12,151 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:32:12,152 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:32:12,152 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 -> BUCHI_PETRI_NET [2023-10-12 17:32:12,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:32:12,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:32:12,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:32:12,359 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:32:12,361 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:32:12,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl [2023-10-12 17:32:12,363 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl' [2023-10-12 17:32:12,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:32:12,395 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:32:12,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:32:12,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:32:12,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:32:12,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,417 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:32:12,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:32:12,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:32:12,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:32:12,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:32:12,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:32:12,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:32:12,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:32:12,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:32:12,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/1) ... [2023-10-12 17:32:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:12,483 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:32:12,509 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:32:12,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:32:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:32:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:32:12,524 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:32:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:32:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:32:12,525 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:32:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:32:12,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:32:12,526 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:32:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:32:12,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:32:12,527 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:32:12,568 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:32:12,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:32:12,692 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:32:12,732 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:32:12,732 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:32:12,734 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:32:12 BoogieIcfgContainer [2023-10-12 17:32:12,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:32:12,736 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:32:12,736 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:32:12,739 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:32:12,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:32:12,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:32:12" (1/2) ... [2023-10-12 17:32:12,741 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@281c5128 and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:32:12, skipping insertion in model container [2023-10-12 17:32:12,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:32:12,741 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:32:12" (2/2) ... [2023-10-12 17:32:12,744 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2023-10-12 17:32:12,795 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:32:12,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:32:12,832 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:32:12,832 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:32:12,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:32:12,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:32:12,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:32:12,841 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:32:12,851 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:32:12,853 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:32:12,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:32:12,860 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:32:12,860 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:32:12,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:32:12,861 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:32:13,064 INFO L134 LiptonReduction]: Checked pairs total: 178 [2023-10-12 17:32:13,064 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:32:13,073 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:32:13,073 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:32:13,073 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:32:13,073 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:32:13,073 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:32:13,073 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:32:13,073 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:32:13,074 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:32:13,074 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:32:13,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:13,080 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:32:13,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:32:13,082 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:13,083 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:32:13,084 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:32:13,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:13,084 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:32:13,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:32:13,085 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:13,087 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [2023-10-12 17:32:13,088 INFO L750 eck$LassoCheckResult]: Loop: 43#[L64-1, L25-1]true [103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum] 43#[L64-1, L25-1]true [2023-10-12 17:32:13,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash 4462, now seen corresponding path program 1 times [2023-10-12 17:32:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064501874] [2023-10-12 17:32:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 134, now seen corresponding path program 1 times [2023-10-12 17:32:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888291380] [2023-10-12 17:32:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 138425, now seen corresponding path program 1 times [2023-10-12 17:32:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79971802] [2023-10-12 17:32:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,380 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:13,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:13,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:13,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:13,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:13,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:13,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:13,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:32:13,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:13,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:13,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:13,413 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:32:13,415 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:32:13,417 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:32:13,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:32:13,422 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:32:13,491 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:13,494 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,497 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:32:13,504 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:32:13,505 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:32:13,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:13,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:13,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:13,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:13,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:13,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:13,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:13,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,562 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:32:13,580 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:32:13,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:13,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:13,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:13,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:13,588 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:32:13,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:13,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:13,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:13,619 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:32:13,620 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:32:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:13,628 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:32:13,629 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:32:13,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:13,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:13,686 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:13,687 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:32:13,692 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:32:13,695 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:32:13,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:13,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:13,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:13,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:32:13,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:13,736 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:32:13,767 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:32:13,768 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:32:13,860 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 5 states and 250 transitions. [2023-10-12 17:32:13,861 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:13,866 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:13,867 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:32:13,870 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:32:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2023-10-12 17:32:13,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:32:13,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:32:13,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:32:13,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:13,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:13,903 INFO L124 PetriNetUnfolderBase]: 207/302 cut-off events. [2023-10-12 17:32:13,903 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-10-12 17:32:13,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 302 events. 207/302 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 875 event pairs, 28 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 468. Up to 104 conditions per place. [2023-10-12 17:32:13,904 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:13,907 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:13,907 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:13,907 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:32:13,907 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:32:13,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:13,912 INFO L124 PetriNetUnfolderBase]: 25/39 cut-off events. [2023-10-12 17:32:13,912 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:32:13,912 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:13,912 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 88#[L37-1, L25-1, L65]true [2023-10-12 17:32:13,913 INFO L750 eck$LassoCheckResult]: Loop: 88#[L37-1, L25-1, L65]true [109] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (= v_k_26 v_p_16) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_A_17 v_k_27) (select v_B_17 v_k_27)))) (< v_k_27 v_N_20)) InVars {A=v_A_17, N=v_N_20, k=v_k_27, C=v_C_23, B=v_B_17} OutVars{A=v_A_17, p=v_p_16, N=v_N_20, k=v_k_26, C=v_C_22, B=v_B_17} AuxVars[] AssignedVars[p, k, C] 88#[L37-1, L25-1, L65]true [109] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (= v_k_26 v_p_16) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_A_17 v_k_27) (select v_B_17 v_k_27)))) (< v_k_27 v_N_20)) InVars {A=v_A_17, N=v_N_20, k=v_k_27, C=v_C_23, B=v_B_17} OutVars{A=v_A_17, p=v_p_16, N=v_N_20, k=v_k_26, C=v_C_22, B=v_B_17} AuxVars[] AssignedVars[p, k, C] 88#[L37-1, L25-1, L65]true [2023-10-12 17:32:13,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 138416, now seen corresponding path program 1 times [2023-10-12 17:32:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118844766] [2023-10-12 17:32:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash 4449, now seen corresponding path program 1 times [2023-10-12 17:32:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257596126] [2023-10-12 17:32:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:13,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 133021264, now seen corresponding path program 1 times [2023-10-12 17:32:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286335715] [2023-10-12 17:32:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:13,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,036 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:14,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:14,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:14,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:14,037 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:14,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:14,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:14,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:32:14,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:14,037 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:14,038 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:32:14,040 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:32:14,042 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:32:14,044 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:32:14,046 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:32:14,074 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:32:14,078 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:32:14,080 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:32:14,082 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:32:14,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:32:14,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:14,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:14,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,164 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:32:14,166 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:32:14,168 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:32:14,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:14,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:14,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:14,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:14,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:14,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:14,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:14,212 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:32:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,221 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:32:14,223 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:32:14,225 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:32:14,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:14,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:14,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:14,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:14,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:14,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:14,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:14,252 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:32:14,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,269 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:32:14,279 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:32:14,279 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:32:14,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:14,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:14,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:14,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:14,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:14,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:14,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:14,294 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:32:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,296 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:32:14,297 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:32:14,299 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:32:14,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:14,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:14,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:14,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:14,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:14,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:14,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:14,341 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:32:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,343 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:32:14,357 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:32:14,357 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:32:14,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:14,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:14,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:14,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:14,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:14,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:14,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:14,393 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:32:14,394 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:32:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:14,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:14,409 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:32:14,418 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:32:14,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:14,436 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:14,437 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:14,437 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:32:14,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:32:14,443 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:32:14,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:14,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:14,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:14,478 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:32:14,478 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:32:14,565 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) Result 7 states and 330 transitions. [2023-10-12 17:32:14,565 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:14,580 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:32:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:32:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2023-10-12 17:32:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:32:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:32:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:32:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:14,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:14,675 INFO L124 PetriNetUnfolderBase]: 613/866 cut-off events. [2023-10-12 17:32:14,676 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-10-12 17:32:14,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 866 events. 613/866 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3159 event pairs, 23 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1848. Up to 309 conditions per place. [2023-10-12 17:32:14,678 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:14,706 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:14,706 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:14,706 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:32:14,706 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:32:14,741 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:32:14,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:14,750 INFO L124 PetriNetUnfolderBase]: 182/253 cut-off events. [2023-10-12 17:32:14,750 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:32:14,750 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:14,750 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 88#[L37-1, L25-1, L65]true [103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum] 88#[L37-1, L25-1, L65]true [97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 147#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:32:14,750 INFO L750 eck$LassoCheckResult]: Loop: 147#[L66, L37-1, L25-1, L49-1]true [106] L49-1-->L50: Formula: (and (< v_l_21 v_p_12) (< v_l_21 v_N_14)) InVars {p=v_p_12, N=v_N_14, l=v_l_21} OutVars{p=v_p_12, N=v_N_14, l=v_l_21} AuxVars[] AssignedVars[] 150#[L66, L37-1, L50, L25-1]true [88] L50-->L49-1: Formula: (and (= (+ (select v_C_12 v_l_10) v_csum_6) v_csum_5) (= v_l_9 (+ v_l_10 1))) InVars {csum=v_csum_6, l=v_l_10, C=v_C_12} OutVars{csum=v_csum_5, l=v_l_9, C=v_C_12} AuxVars[] AssignedVars[csum, l] 147#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:32:14,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 133021066, now seen corresponding path program 1 times [2023-10-12 17:32:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124996590] [2023-10-12 17:32:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 4335, now seen corresponding path program 1 times [2023-10-12 17:32:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344330699] [2023-10-12 17:32:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:14,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:14,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1015771080, now seen corresponding path program 1 times [2023-10-12 17:32:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726653868] [2023-10-12 17:32:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,813 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:32:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:32:14,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726653868] [2023-10-12 17:32:14,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726653868] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:32:14,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:32:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:32:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403022024] [2023-10-12 17:32:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:32:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:32:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:32:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:32:14,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 2992 transitions, 21408 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:32:14,834 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:32:14,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:32:15,062 INFO L124 PetriNetUnfolderBase]: 1028/1542 cut-off events. [2023-10-12 17:32:15,063 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-10-12 17:32:15,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1542 events. 1028/1542 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6800 event pairs, 44 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 4376. Up to 821 conditions per place. [2023-10-12 17:32:15,073 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 267 selfloop transitions, 38 changer transitions 93/398 dead transitions. [2023-10-12 17:32:15,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,161 INFO L124 PetriNetUnfolderBase]: 1028/1542 cut-off events. [2023-10-12 17:32:15,161 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-10-12 17:32:15,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1542 events. 1028/1542 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6800 event pairs, 44 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 4376. Up to 821 conditions per place. [2023-10-12 17:32:15,164 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,167 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:32:15,169 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,169 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:32:15,169 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 places, 398 transitions, 3565 flow [2023-10-12 17:32:15,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:15,191 INFO L124 PetriNetUnfolderBase]: 277/405 cut-off events. [2023-10-12 17:32:15,191 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-10-12 17:32:15,191 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:15,192 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [102] L25-1-->thread1EXIT: Formula: (<= v_N_8 v_i_14) InVars {N=v_N_8, i=v_i_14} OutVars{N=v_N_8, i=v_i_14} AuxVars[] AssignedVars[] 165#[L64-1, thread1EXIT]true [94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 167#[L37-1, thread1EXIT, L65]true [97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 169#[L66, L37-1, thread1EXIT, L49-1]true [2023-10-12 17:32:15,192 INFO L750 eck$LassoCheckResult]: Loop: 169#[L66, L37-1, thread1EXIT, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 169#[L66, L37-1, thread1EXIT, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 169#[L66, L37-1, thread1EXIT, L49-1]true [2023-10-12 17:32:15,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash 133028475, now seen corresponding path program 1 times [2023-10-12 17:32:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574379427] [2023-10-12 17:32:15,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:15,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:15,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 4385, now seen corresponding path program 1 times [2023-10-12 17:32:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765880224] [2023-10-12 17:32:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:15,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1008650981, now seen corresponding path program 1 times [2023-10-12 17:32:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914488899] [2023-10-12 17:32:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:32:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914488899] [2023-10-12 17:32:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914488899] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:32:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:32:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:32:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915607973] [2023-10-12 17:32:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:32:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:32:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:32:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:32:15,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 398 transitions, 3565 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:32:15,233 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:32:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:32:15,445 INFO L124 PetriNetUnfolderBase]: 1556/2444 cut-off events. [2023-10-12 17:32:15,445 INFO L125 PetriNetUnfolderBase]: For 753/753 co-relation queries the response was YES. [2023-10-12 17:32:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12859 conditions, 2444 events. 1556/2444 cut-off events. For 753/753 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12687 event pairs, 25 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 8157. Up to 1556 conditions per place. [2023-10-12 17:32:15,457 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 508 selfloop transitions, 113 changer transitions 244/865 dead transitions. [2023-10-12 17:32:15,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,631 INFO L124 PetriNetUnfolderBase]: 1556/2444 cut-off events. [2023-10-12 17:32:15,631 INFO L125 PetriNetUnfolderBase]: For 753/753 co-relation queries the response was YES. [2023-10-12 17:32:15,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12859 conditions, 2444 events. 1556/2444 cut-off events. For 753/753 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12702 event pairs, 25 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 8157. Up to 1556 conditions per place. [2023-10-12 17:32:15,635 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,644 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:32:15,645 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,645 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:32:15,645 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 places, 865 transitions, 9376 flow [2023-10-12 17:32:15,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:15,693 INFO L124 PetriNetUnfolderBase]: 398/581 cut-off events. [2023-10-12 17:32:15,693 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-10-12 17:32:15,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:15,694 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 88#[L37-1, L25-1, L65]true [103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum] 88#[L37-1, L25-1, L65]true [108] L37-1-->thread2EXIT: Formula: (<= v_N_18 v_k_24) InVars {N=v_N_18, k=v_k_24} OutVars{N=v_N_18, k=v_k_24} AuxVars[] AssignedVars[] 190#[thread2EXIT, L25-1, L65]true [97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 192#[L66, thread2EXIT, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 192#[L66, thread2EXIT, L25-1, L49-1]true [2023-10-12 17:32:15,694 INFO L750 eck$LassoCheckResult]: Loop: 192#[L66, thread2EXIT, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 192#[L66, thread2EXIT, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 192#[L66, thread2EXIT, L25-1, L49-1]true [2023-10-12 17:32:15,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1015760769, now seen corresponding path program 1 times [2023-10-12 17:32:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415692730] [2023-10-12 17:32:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:15,715 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:32:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:32:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415692730] [2023-10-12 17:32:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415692730] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:32:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:32:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:32:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928524990] [2023-10-12 17:32:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:32:15,716 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:32:15,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 4385, now seen corresponding path program 2 times [2023-10-12 17:32:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648140174] [2023-10-12 17:32:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:15,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:32:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:32:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:32:15,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 865 transitions, 9376 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:32:15,728 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:32:15,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:32:15,965 INFO L124 PetriNetUnfolderBase]: 1658/2645 cut-off events. [2023-10-12 17:32:15,965 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2023-10-12 17:32:15,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16535 conditions, 2645 events. 1658/2645 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14301 event pairs, 17 based on Foata normal form. 28/1747 useless extension candidates. Maximal degree in co-relation 10376. Up to 2145 conditions per place. [2023-10-12 17:32:15,980 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 661 selfloop transitions, 27 changer transitions 271/959 dead transitions. [2023-10-12 17:32:15,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:15,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:16,193 INFO L124 PetriNetUnfolderBase]: 1658/2645 cut-off events. [2023-10-12 17:32:16,194 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2023-10-12 17:32:16,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16535 conditions, 2645 events. 1658/2645 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14316 event pairs, 17 based on Foata normal form. 0/1719 useless extension candidates. Maximal degree in co-relation 10376. Up to 2145 conditions per place. [2023-10-12 17:32:16,197 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:16,207 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:32:16,208 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:16,208 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:32:16,208 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 959 transitions, 12321 flow [2023-10-12 17:32:16,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:16,241 INFO L124 PetriNetUnfolderBase]: 269/418 cut-off events. [2023-10-12 17:32:16,241 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-10-12 17:32:16,242 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:16,242 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 88#[L37-1, L25-1, L65]true [103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum] 88#[L37-1, L25-1, L65]true [97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 147#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:32:16,242 INFO L750 eck$LassoCheckResult]: Loop: 147#[L66, L37-1, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 147#[L66, L37-1, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 147#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:32:16,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 133021066, now seen corresponding path program 2 times [2023-10-12 17:32:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:16,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237948224] [2023-10-12 17:32:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:16,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 4385, now seen corresponding path program 3 times [2023-10-12 17:32:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222882149] [2023-10-12 17:32:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:16,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1015771030, now seen corresponding path program 1 times [2023-10-12 17:32:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391305028] [2023-10-12 17:32:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:16,413 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:32:16 BoogieIcfgContainer [2023-10-12 17:32:16,413 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:32:16,413 INFO L158 Benchmark]: Toolchain (without parser) took 4018.55ms. Allocated memory was 194.0MB in the beginning and 315.6MB in the end (delta: 121.6MB). Free memory was 145.5MB in the beginning and 274.3MB in the end (delta: -128.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:32:16,413 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.56ms. Allocated memory is still 194.0MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:32:16,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 194.0MB. Free memory was 145.4MB in the beginning and 144.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:32:16,414 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 194.0MB. Free memory was 144.0MB in the beginning and 142.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:32:16,414 INFO L158 Benchmark]: RCFGBuilder took 286.70ms. Allocated memory is still 194.0MB. Free memory was 142.8MB in the beginning and 163.6MB in the end (delta: -20.8MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2023-10-12 17:32:16,415 INFO L158 Benchmark]: BuchiAutomizer took 3676.78ms. Allocated memory was 194.0MB in the beginning and 315.6MB in the end (delta: 121.6MB). Free memory was 163.2MB in the beginning and 274.3MB in the end (delta: -111.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2023-10-12 17:32:16,416 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.56ms. Allocated memory is still 194.0MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 194.0MB. Free memory was 145.4MB in the beginning and 144.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 194.0MB. Free memory was 144.0MB in the beginning and 142.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.70ms. Allocated memory is still 194.0MB. Free memory was 142.8MB in the beginning and 163.6MB in the end (delta: -20.8MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 3676.78ms. Allocated memory was 194.0MB in the beginning and 315.6MB in the end (delta: 121.6MB). Free memory was 163.2MB in the beginning and 274.3MB in the end (delta: -111.1MB). Peak memory consumption was 10.7MB. 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 12321 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 86 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN1 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf100 lsp69 ukn67 mio100 lsp75 div100 bol100 ite100 ukn100 eq168 hnf91 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == asum && i == bsum && i == csum && i == 0; [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L24] COND TRUE 1 i < N [L26] 1 asum := asum + A[i]; [L27] 1 bsum := bsum + B[i]; [L28] 1 i := i + 1; VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == asum && i == bsum && i == csum && i == 0; [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L24] COND TRUE 1 i < N [L26] 1 asum := asum + A[i]; [L27] 1 bsum := bsum + B[i]; [L28] 1 i := i + 1; VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 108, unknown conditional: 0, unknown unconditional: 108] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:32:16,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...