/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_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:42,935 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:42,977 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:14:42,991 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:42,992 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:42,992 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:42,993 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:42,993 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:42,993 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:42,994 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:42,994 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:42,994 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:42,994 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:42,995 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:42,995 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:42,995 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:42,995 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:42,996 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:42,996 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:42,996 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:42,996 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:42,997 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:42,997 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:42,997 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:42,997 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:42,998 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:42,998 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:42,998 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:42,998 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:42,999 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:42,999 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:42,999 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:42,999 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:43,000 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:43,000 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_AUTOMATON [2023-10-12 17:14:43,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:43,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:43,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:43,215 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:43,216 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:43,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl [2023-10-12 17:14:43,217 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl' [2023-10-12 17:14:43,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:43,239 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:43,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:43,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:43,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:43,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,258 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:43,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:43,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:43,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:43,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:43,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:43,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:43,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:43,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:43,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/1) ... [2023-10-12 17:14:43,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:43,324 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:14:43,333 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:14:43,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:43,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:43,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:43,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:43,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:43,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:43,364 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:14:43,397 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:43,399 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:43,476 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:43,481 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:43,481 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:43,482 INFO L201 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:43 BoogieIcfgContainer [2023-10-12 17:14:43,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:43,483 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:43,483 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:43,487 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:43,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:43,487 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:43" (1/2) ... [2023-10-12 17:14:43,489 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c8e8a1 and model type easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:43, skipping insertion in model container [2023-10-12 17:14:43,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:43,489 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:43" (2/2) ... [2023-10-12 17:14:43,490 INFO L332 chiAutomizerObserver]: Analyzing ICFG easy11.wvr.bpl [2023-10-12 17:14:43,566 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:14:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:14:43,620 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:14:43,620 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:43,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:14:43,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:14:43,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2023-10-12 17:14:43,628 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:43,637 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:14:43,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:14:43,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2023-10-12 17:14:43,643 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:14:43,643 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:43,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:14:43,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 96 [2023-10-12 17:14:43,809 INFO L134 LiptonReduction]: Checked pairs total: 53 [2023-10-12 17:14:43,809 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:14:43,825 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:43,825 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:43,825 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:43,825 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:43,825 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:43,826 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:43,826 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:43,826 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:43,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:43,853 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:43,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:43,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:43,857 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:43,857 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:43,857 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:43,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:14:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:43,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:43,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:43,859 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:43,859 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:43,862 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]don't care [41] $Ultimate##0-->L38: Formula: (and (= v_Y_5 0) (<= v_X_3 10000)) InVars {Y=v_Y_5, X=v_X_3} OutVars{Y=v_Y_5, X=v_X_3} AuxVars[] AssignedVars[] 34#[L38]don't care [64] L38-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_x] 36#[L38-1, $Ultimate##0]don't care [50] $Ultimate##0-->L17-1: Formula: (= v_X_1 v_thread1Thread1of1ForFork0_x_1) InVars {X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} OutVars{X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} AuxVars[] AssignedVars[] 38#[L17-1, L38-1]don't care [2023-10-12 17:14:43,862 INFO L750 eck$LassoCheckResult]: Loop: 38#[L17-1, L38-1]don't care [75] L17-1-->L17-1: Formula: (and (< v_thread1Thread1of1ForFork0_x_22 10000) (= v_thread1Thread1of1ForFork0_x_21 (+ v_thread1Thread1of1ForFork0_x_22 1))) InVars {thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_22} OutVars{thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_x] 38#[L17-1, L38-1]don't care [2023-10-12 17:14:43,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 71226, now seen corresponding path program 1 times [2023-10-12 17:14:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63862016] [2023-10-12 17:14:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:43,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:43,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:43,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 1 times [2023-10-12 17:14:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71725469] [2023-10-12 17:14:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:43,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:43,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:43,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2208081, now seen corresponding path program 1 times [2023-10-12 17:14:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55218493] [2023-10-12 17:14:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:43,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:44,036 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:44,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:44,037 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:44,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:44,038 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:44,038 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:44,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:44,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:14:44,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:44,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:44,048 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:14:44,083 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:44,084 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:44,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,088 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:14:44,089 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:14:44,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:44,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:44,129 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:14:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,130 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:14:44,132 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:14:44,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:44,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:44,163 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:44,166 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:14:44,167 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:44,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:44,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:44,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:44,167 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:44,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:44,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:44,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:14:44,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:44,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:44,168 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:14:44,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:44,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:44,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,494 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:14:44,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:14:44,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:44,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:44,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:44,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:44,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:44,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:44,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:44,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:44,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:44,524 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:44,524 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:44,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,528 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:14:44,529 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:14:44,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:44,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:44,638 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:44,639 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_x) = -2*thread1Thread1of1ForFork0_x + 19999 Supporting invariants [] [2023-10-12 17:14:44,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:14:44,660 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:44,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:44,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:44,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:44,710 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:44,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:44,711 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:14:44,730 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:14:44,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:44,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 100 transitions. Complement of second has 5 states. [2023-10-12 17:14:44,767 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:14:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:44,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:44,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:44,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:44,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:44,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:44,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:44,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 100 transitions. [2023-10-12 17:14:44,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:44,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 53 transitions. [2023-10-12 17:14:44,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-10-12 17:14:44,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:14:44,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 53 transitions. [2023-10-12 17:14:44,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:44,782 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2023-10-12 17:14:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 53 transitions. [2023-10-12 17:14:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:14:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 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:14:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2023-10-12 17:14:44,799 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:44,799 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:44,799 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:44,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2023-10-12 17:14:44,800 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:44,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:44,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:44,801 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:44,801 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:44,801 INFO L748 eck$LassoCheckResult]: Stem: 181#[$Ultimate##0]don't care [41] $Ultimate##0-->L38: Formula: (and (= v_Y_5 0) (<= v_X_3 10000)) InVars {Y=v_Y_5, X=v_X_3} OutVars{Y=v_Y_5, X=v_X_3} AuxVars[] AssignedVars[] 183#[L38]don't care [64] L38-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_x] 155#[L38-1, $Ultimate##0]don't care [67] L38-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_x, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 159#[L39, $Ultimate##0, $Ultimate##0]don't care [56] $Ultimate##0-->L28-1: Formula: (= v_X_2 v_thread2Thread1of1ForFork1_x_1) InVars {thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_1, X=v_X_2} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_1, X=v_X_2} AuxVars[] AssignedVars[] 169#[L28-1, L39, $Ultimate##0]don't care [2023-10-12 17:14:44,801 INFO L750 eck$LassoCheckResult]: Loop: 169#[L28-1, L39, $Ultimate##0]don't care [72] L28-1-->L28-1: Formula: (and (= v_thread2Thread1of1ForFork1_x_19 (+ v_thread2Thread1of1ForFork1_x_20 1)) (< v_thread2Thread1of1ForFork1_x_20 10000)) InVars {thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_20} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_x] 169#[L28-1, L39, $Ultimate##0]don't care [2023-10-12 17:14:44,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2208589, now seen corresponding path program 1 times [2023-10-12 17:14:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501317650] [2023-10-12 17:14:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:44,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2023-10-12 17:14:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:44,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220798632] [2023-10-12 17:14:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:44,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash 68466331, now seen corresponding path program 1 times [2023-10-12 17:14:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143590086] [2023-10-12 17:14:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:44,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:44,833 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:44,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:44,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:44,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:44,833 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:44,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:44,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:44,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:14:44,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:44,834 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:44,834 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:14:44,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:44,849 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:44,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,865 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:14:44,893 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:14:44,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:44,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:44,920 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:14:44,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,938 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:14:44,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:44,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:44,958 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:14:44,959 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:44,962 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:14:44,962 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:44,962 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:44,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:44,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:44,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:44,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:44,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:44,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:14:44,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:44,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:44,964 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:14:44,978 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:44,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:44,980 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:14:44,983 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:14:44,988 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:14:44,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:44,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:44,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:44,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:44,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:44,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:44,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:45,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:45,028 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:45,029 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:45,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:45,031 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:14:45,032 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:14:45,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:45,066 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:45,066 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:45,066 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_x) = -2*thread2Thread1of1ForFork1_x + 19999 Supporting invariants [] [2023-10-12 17:14:45,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:14:45,071 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:45,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:45,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:45,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:45,102 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:45,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:45,103 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:14:45,103 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:14:45,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:45,121 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 81 transitions. Complement of second has 4 states. [2023-10-12 17:14:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2023-10-12 17:14:45,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:45,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:45,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:14:45,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:45,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:14:45,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:45,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 81 transitions. [2023-10-12 17:14:45,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:45,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2023-10-12 17:14:45,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:45,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:45,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:45,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:45,124 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:45,124 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:45,125 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:45,125 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:45,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:45,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:45,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:45,129 INFO L201 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:45 BoogieIcfgContainer [2023-10-12 17:14:45,130 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:45,130 INFO L158 Benchmark]: Toolchain (without parser) took 1890.98ms. Allocated memory was 166.7MB in the beginning and 309.3MB in the end (delta: 142.6MB). Free memory was 117.3MB in the beginning and 227.4MB in the end (delta: -110.2MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2023-10-12 17:14:45,130 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 166.7MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:45,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.41ms. Allocated memory is still 166.7MB. Free memory was 117.1MB in the beginning and 115.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:45,131 INFO L158 Benchmark]: Boogie Preprocessor took 13.27ms. Allocated memory is still 166.7MB. Free memory was 115.6MB in the beginning and 114.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:45,131 INFO L158 Benchmark]: RCFGBuilder took 207.72ms. Allocated memory is still 166.7MB. Free memory was 114.6MB in the beginning and 105.7MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:45,132 INFO L158 Benchmark]: BuchiAutomizer took 1646.76ms. Allocated memory was 166.7MB in the beginning and 309.3MB in the end (delta: 142.6MB). Free memory was 105.6MB in the beginning and 227.4MB in the end (delta: -121.9MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2023-10-12 17:14:45,133 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.25ms. Allocated memory is still 166.7MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.41ms. Allocated memory is still 166.7MB. Free memory was 117.1MB in the beginning and 115.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.27ms. Allocated memory is still 166.7MB. Free memory was 115.6MB in the beginning and 114.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 207.72ms. Allocated memory is still 166.7MB. Free memory was 114.6MB in the beginning and 105.7MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1646.76ms. Allocated memory was 166.7MB in the beginning and 309.3MB in the end (delta: 142.6MB). Free memory was 105.6MB in the beginning and 227.4MB in the end (delta: -121.9MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19999 + x * -2 and consists of 4 locations. One deterministic module has affine ranking function x * -2 + 19999 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 450ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 26 PlacesBefore, 18 PlacesAfterwards, 21 TransitionsBefore, 13 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 49, unknown conditional: 0, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:45,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:45,345 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:14:45,552 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...