/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:02:33,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:02:33,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:02:33,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:02:33,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:02:33,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:02:33,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:02:33,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:02:33,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:02:33,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:02:33,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:02:33,265 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:02:33,265 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:02:33,266 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:02:33,266 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:02:33,266 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:02:33,267 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:02:33,267 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:02:33,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:02:33,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:02:33,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:02:33,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:02:33,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:02:33,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:02:33,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:02:33,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:02:33,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:02:33,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:02:33,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:02:33,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:02:33,301 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:02:33,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:02:33,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:02:33,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:02:33,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:02:33,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:02:33,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:02:33,303 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:02:33,303 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:02:33,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:02:33,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:02:33,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:02:33,961 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:02:33,962 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:02:33,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl [2024-02-10 01:02:33,964 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2024-02-10 01:02:34,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:02:34,073 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:02:34,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:34,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:02:34,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:02:34,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,142 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:02:34,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:34,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:02:34,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:02:34,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:02:34,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:02:34,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:02:34,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:02:34,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:02:34,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/1) ... [2024-02-10 01:02:34,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:34,317 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) [2024-02-10 01:02:34,359 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 [2024-02-10 01:02:34,410 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2024-02-10 01:02:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2024-02-10 01:02:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2024-02-10 01:02:34,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2024-02-10 01:02:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2024-02-10 01:02:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2024-02-10 01:02:34,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:02:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:02:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:02:34,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2024-02-10 01:02:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2024-02-10 01:02:34,412 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2024-02-10 01:02:34,412 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:02:34,457 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:02:34,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:02:34,543 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:02:34,564 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:02:34,564 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:02:34,566 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:34 BoogieIcfgContainer [2024-02-10 01:02:34,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:02:34,567 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:02:34,567 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:02:34,583 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:02:34,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:34,584 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:02:34" (1/2) ... [2024-02-10 01:02:34,586 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14525367 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:02:34, skipping insertion in model container [2024-02-10 01:02:34,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:34,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:34" (2/2) ... [2024-02-10 01:02:34,587 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2024-02-10 01:02:34,631 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:02:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 80 flow [2024-02-10 01:02:34,679 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-02-10 01:02:34,679 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:02:34,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-02-10 01:02:34,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 80 flow [2024-02-10 01:02:34,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2024-02-10 01:02:34,694 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:02:34,694 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:02:34,694 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:02:34,694 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:02:34,694 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:02:34,695 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:02:34,695 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:02:34,695 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:02:34,696 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 25 transitions, 65 flow [2024-02-10 01:02:34,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:34,701 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-10 01:02:34,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:34,701 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:34,704 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:02:34,705 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 25 transitions, 65 flow [2024-02-10 01:02:34,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:34,708 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-10 01:02:34,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:34,708 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:34,713 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [76] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1] 43#[L19, L64]true [77] L19-->L21-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1] 45#[L21-1, L64]true [2024-02-10 01:02:34,714 INFO L750 eck$LassoCheckResult]: Loop: 45#[L21-1, L64]true [79] L21-1-->L21: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[] 48#[L21, L64]true [81] L21-->L21-1: Formula: (and (= (+ v_i1_12 1) v_i1_11) (= v_sum1_6 (+ (select v_A_15 v_i1_12) v_sum1_7))) InVars {sum1=v_sum1_7, A=v_A_15, i1=v_i1_12} OutVars{sum1=v_sum1_6, A=v_A_15, i1=v_i1_11} AuxVars[] AssignedVars[sum1, i1] 45#[L21-1, L64]true [2024-02-10 01:02:34,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 123519, now seen corresponding path program 1 times [2024-02-10 01:02:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759857269] [2024-02-10 01:02:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2024-02-10 01:02:34,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719881177] [2024-02-10 01:02:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash 118704289, now seen corresponding path program 1 times [2024-02-10 01:02:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298913087] [2024-02-10 01:02:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:34,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:34,914 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:34,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:34,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:34,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:34,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:34,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:34,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:34,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:34,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:02:34,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:34,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:34,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:34,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:34,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:35,020 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:35,023 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:35,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:35,027 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) [2024-02-10 01:02:35,031 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 [2024-02-10 01:02:35,032 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 [2024-02-10 01:02:35,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:35,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:35,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:35,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:35,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:35,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:35,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:35,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:02:35,085 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 01:02:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:35,138 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) [2024-02-10 01:02:35,140 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 [2024-02-10 01:02:35,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:35,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:35,154 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:35,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2024-02-10 01:02:35,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:02:35,165 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:35,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:35,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:35,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:35,307 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:35,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:35,453 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 [2024-02-10 01:02:35,458 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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) [2024-02-10 01:02:35,712 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 9 states and 392 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:35,714 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:35,714 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:35,715 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:02:35,763 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:02:35,763 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:35,769 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 [2024-02-10 01:02:35,774 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) [2024-02-10 01:02:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-10 01:02:35,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 3 letters. Loop has 2 letters. [2024-02-10 01:02:35,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 01:02:35,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 3 letters. Loop has 4 letters. [2024-02-10 01:02:35,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:35,781 INFO L428 stractBuchiCegarLoop]: Abstraction has has 41 places, 314 transitions, 1451 flow [2024-02-10 01:02:35,781 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:02:35,782 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 314 transitions, 1451 flow [2024-02-10 01:02:35,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:35,817 INFO L124 PetriNetUnfolderBase]: 81/117 cut-off events. [2024-02-10 01:02:35,817 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-02-10 01:02:35,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:35,818 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 100#[$Ultimate##0, $Ultimate##0, L65]true [82] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2] 102#[L34, $Ultimate##0, L65]true [83] L34-->L36-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2] 104#[L36-1, $Ultimate##0, L65]true [85] L36-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[] 106#[L36, $Ultimate##0, L65]true [87] L36-->L36-1: Formula: (and (= (+ v_i2_12 1) v_i2_11) (= (+ (select v_A_13 v_i2_12) v_sum2_7) v_sum2_6)) InVars {A=v_A_13, sum2=v_sum2_7, i2=v_i2_12} OutVars{A=v_A_13, sum2=v_sum2_6, i2=v_i2_11} AuxVars[] AssignedVars[sum2, i2] 104#[L36-1, $Ultimate##0, L65]true [2024-02-10 01:02:35,818 INFO L750 eck$LassoCheckResult]: Loop: 104#[L36-1, $Ultimate##0, L65]true [85] L36-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[] 106#[L36, $Ultimate##0, L65]true [87] L36-->L36-1: Formula: (and (= (+ v_i2_12 1) v_i2_11) (= (+ (select v_A_13 v_i2_12) v_sum2_7) v_sum2_6)) InVars {A=v_A_13, sum2=v_sum2_7, i2=v_i2_12} OutVars{A=v_A_13, sum2=v_sum2_6, i2=v_i2_11} AuxVars[] AssignedVars[sum2, i2] 104#[L36-1, $Ultimate##0, L65]true [2024-02-10 01:02:35,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -594663865, now seen corresponding path program 1 times [2024-02-10 01:02:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320215499] [2024-02-10 01:02:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:35,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2024-02-10 01:02:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461244892] [2024-02-10 01:02:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:35,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -241321175, now seen corresponding path program 2 times [2024-02-10 01:02:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519370893] [2024-02-10 01:02:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:35,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:35,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 01:02:36,058 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:36,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:36,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:36,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:36,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:36,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:36,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:36,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:02:36,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:36,059 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:36,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:02:36,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:36,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,219 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) [2024-02-10 01:02:36,221 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 [2024-02-10 01:02:36,224 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 [2024-02-10 01:02:36,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:36,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:36,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:36,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:36,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:02:36,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,251 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) [2024-02-10 01:02:36,253 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 [2024-02-10 01:02:36,254 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 [2024-02-10 01:02:36,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:36,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:36,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:36,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:36,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:02:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,283 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) [2024-02-10 01:02:36,285 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 [2024-02-10 01:02:36,286 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 [2024-02-10 01:02:36,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:36,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:36,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:36,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:36,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:36,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:36,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:36,339 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 01:02:36,339 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:02:36,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:36,341 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) [2024-02-10 01:02:36,353 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 [2024-02-10 01:02:36,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:36,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:36,382 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:36,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-10 01:02:36,387 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 [2024-02-10 01:02:36,388 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:36,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:36,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:36,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:36,441 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:02:36,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:02:36,493 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 [2024-02-10 01:02:36,493 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-02-10 01:02:36,695 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 states and 392 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:02:36,695 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:36,695 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 392 transitions. [2024-02-10 01:02:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 392 transitions. [2024-02-10 01:02:36,738 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 392 transitions. [2024-02-10 01:02:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 392 transitions. [2024-02-10 01:02:37,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 01:02:37,220 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:37,220 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:37,221 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 [2024-02-10 01:02:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-02-10 01:02:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-10 01:02:37,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-10 01:02:37,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 8 letters. Loop has 2 letters. [2024-02-10 01:02:37,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 01:02:37,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:37,224 INFO L428 stractBuchiCegarLoop]: Abstraction has has 54 places, 5130 transitions, 34095 flow [2024-02-10 01:02:37,225 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:02:37,225 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 places, 5130 transitions, 34095 flow [2024-02-10 01:02:37,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:37,610 INFO L124 PetriNetUnfolderBase]: 540/671 cut-off events. [2024-02-10 01:02:37,610 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-02-10 01:02:37,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:37,611 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 100#[$Ultimate##0, $Ultimate##0, L65]true [101] L65-->$Ultimate##0: Formula: (and (= 3 v_incThread1of1ForFork2_thidvar1_2) (= 3 v_incThread1of1ForFork2_thidvar2_2) (= 3 v_incThread1of1ForFork2_thidvar0_2)) InVars {} OutVars{incThread1of1ForFork2_thidvar2=v_incThread1of1ForFork2_thidvar2_2, incThread1of1ForFork2_thidvar1=v_incThread1of1ForFork2_thidvar1_2, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_12, incThread1of1ForFork2_thidvar0=v_incThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[incThread1of1ForFork2_thidvar2, incThread1of1ForFork2_thidvar1, incThread1of1ForFork2_j, incThread1of1ForFork2_thidvar0] 168#[L66, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j] 170#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [90] L51-1-->L50: Formula: (< v_incThread1of1ForFork2_j_5 v_N_5) InVars {incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} AuxVars[] AssignedVars[] 172#[L66, $Ultimate##0, L50, $Ultimate##0]true [92] L50-->L51-1: Formula: (or (and (= v_A_In_1 v_A_Out_2) (or (<= v_i1_In_1 v_incThread1of1ForFork2_j_7) (<= v_i2_In_1 v_incThread1of1ForFork2_j_7)) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7)) (and (< v_incThread1of1ForFork2_j_7 v_i2_In_1) (< v_incThread1of1ForFork2_j_7 v_i1_In_1) (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (= v_A_Out_2 (store v_A_In_1 v_incThread1of1ForFork2_j_7 (+ (select v_A_In_1 v_incThread1of1ForFork2_j_7) 1))))) InVars {A=v_A_In_1, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7} OutVars{A=v_A_Out_2, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j] 170#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2024-02-10 01:02:37,611 INFO L750 eck$LassoCheckResult]: Loop: 170#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [90] L51-1-->L50: Formula: (< v_incThread1of1ForFork2_j_5 v_N_5) InVars {incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5} AuxVars[] AssignedVars[] 172#[L66, $Ultimate##0, L50, $Ultimate##0]true [92] L50-->L51-1: Formula: (or (and (= v_A_In_1 v_A_Out_2) (or (<= v_i1_In_1 v_incThread1of1ForFork2_j_7) (<= v_i2_In_1 v_incThread1of1ForFork2_j_7)) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7)) (and (< v_incThread1of1ForFork2_j_7 v_i2_In_1) (< v_incThread1of1ForFork2_j_7 v_i1_In_1) (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (= v_A_Out_2 (store v_A_In_1 v_incThread1of1ForFork2_j_7 (+ (select v_A_In_1 v_incThread1of1ForFork2_j_7) 1))))) InVars {A=v_A_In_1, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7} OutVars{A=v_A_Out_2, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j] 170#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2024-02-10 01:02:37,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -594092871, now seen corresponding path program 1 times [2024-02-10 01:02:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285403251] [2024-02-10 01:02:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:37,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2024-02-10 01:02:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101286849] [2024-02-10 01:02:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:37,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash 307404219, now seen corresponding path program 2 times [2024-02-10 01:02:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937048415] [2024-02-10 01:02:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:37,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,152 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:02:38 BoogieIcfgContainer [2024-02-10 01:02:38,153 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:02:38,153 INFO L158 Benchmark]: Toolchain (without parser) took 4080.47ms. Allocated memory was 168.8MB in the beginning and 264.2MB in the end (delta: 95.4MB). Free memory was 140.2MB in the beginning and 222.7MB in the end (delta: -82.6MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2024-02-10 01:02:38,154 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 168.8MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:02:38,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.68ms. Allocated memory was 168.8MB in the beginning and 264.2MB in the end (delta: 95.4MB). Free memory was 140.1MB in the beginning and 235.9MB in the end (delta: -95.8MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2024-02-10 01:02:38,154 INFO L158 Benchmark]: Boogie Preprocessor took 75.90ms. Allocated memory is still 264.2MB. Free memory was 235.8MB in the beginning and 239.8MB in the end (delta: -4.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:02:38,155 INFO L158 Benchmark]: RCFGBuilder took 333.53ms. Allocated memory is still 264.2MB. Free memory was 239.8MB in the beginning and 228.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:02:38,155 INFO L158 Benchmark]: BuchiAutomizer took 3585.94ms. Allocated memory is still 264.2MB. Free memory was 228.3MB in the beginning and 222.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2024-02-10 01:02:38,156 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.15ms. Allocated memory is still 168.8MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.68ms. Allocated memory was 168.8MB in the beginning and 264.2MB in the end (delta: 95.4MB). Free memory was 140.1MB in the beginning and 235.9MB in the end (delta: -95.8MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.90ms. Allocated memory is still 264.2MB. Free memory was 235.8MB in the beginning and 239.8MB in the end (delta: -4.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.53ms. Allocated memory is still 264.2MB. Free memory was 239.8MB in the beginning and 228.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3585.94ms. Allocated memory is still 264.2MB. Free memory was 228.3MB in the beginning and 222.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 5 locations. The remainder module has 34095 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 114 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital33 mio100 ax100 hnf100 lsp83 ukn89 mio100 lsp65 div100 bol100 ite100 ukn100 eq163 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 129ms 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.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 49]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] [L49] COND TRUE 3 j < N VAL [N=1, j=0] [L51] COND FALSE 3 !(j < i1 && j < i2) VAL [N=1, i1=0, i2=0, j=0] Loop: [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 49]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] [L49] COND TRUE 3 j < N VAL [N=1, j=0] [L51] COND FALSE 3 !(j < i1 && j < i2) VAL [N=1, i1=0, i2=0, j=0] Loop: [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:02:38,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...