/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:40,104 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:40,141 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:36:40,157 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:40,157 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:40,158 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:40,158 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:40,159 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:40,159 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:40,159 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:40,159 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:40,160 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:40,160 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:40,160 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:40,160 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:40,161 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:40,161 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:40,161 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:40,161 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:40,162 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:40,162 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:40,162 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:40,162 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:40,163 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:40,163 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:40,163 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:40,163 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:40,163 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:40,164 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:40,164 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:40,164 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:40,164 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:40,165 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:40,165 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:40,166 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:36:40,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:40,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:40,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:40,362 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:40,364 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:40,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl [2023-10-12 17:36:40,365 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl' [2023-10-12 17:36:40,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:40,384 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:40,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:40,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:40,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:40,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,408 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:40,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:40,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:40,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:40,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:40,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:40,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:40,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,453 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:36:40,471 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:36:40,478 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2023-10-12 17:36:40,479 INFO L130 BoogieDeclarations]: Found specification of procedure once [2023-10-12 17:36:40,479 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2023-10-12 17:36:40,479 INFO L124 BoogieDeclarations]: Specification and implementation of procedure double given in one single declaration [2023-10-12 17:36:40,479 INFO L130 BoogieDeclarations]: Found specification of procedure double [2023-10-12 17:36:40,479 INFO L138 BoogieDeclarations]: Found implementation of procedure double [2023-10-12 17:36:40,479 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:40,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:40,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:40,480 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:36:40,512 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:40,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:40,568 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:40,572 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:40,572 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:40,574 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40 BoogieIcfgContainer [2023-10-12 17:36:40,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:40,574 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:40,574 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:40,577 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:40,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,578 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/2) ... [2023-10-12 17:36:40,578 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65399c9a and model type concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:40, skipping insertion in model container [2023-10-12 17:36:40,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,579 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40" (2/2) ... [2023-10-12 17:36:40,580 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_TwoOne_nonterminating.bpl [2023-10-12 17:36:40,613 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:36:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:36:40,643 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:36:40,643 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:36:40,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:36:40,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,650 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:40,677 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,679 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,683 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:36:40,683 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:40,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:36:40,683 INFO L119 LiptonReduction]: Number of co-enabled transitions 56 [2023-10-12 17:36:40,739 INFO L134 LiptonReduction]: Checked pairs total: 77 [2023-10-12 17:36:40,739 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:36:40,756 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:40,757 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:40,757 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:40,757 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:40,757 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:40,757 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:40,757 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:40,757 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:40,758 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 13 transitions, 44 flow [2023-10-12 17:36:40,760 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][6], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][3]][3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][11]] [2023-10-12 17:36:40,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,761 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,761 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,763 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:40,763 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 13 transitions, 44 flow [2023-10-12 17:36:40,764 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][6], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][3]][3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][11]] [2023-10-12 17:36:40,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,765 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,765 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,768 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 27#[L8]true [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 29#[L8-1, L17]true [2023-10-12 17:36:40,768 INFO L750 eck$LassoCheckResult]: Loop: 29#[L8-1, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L8-1, L17]true [2023-10-12 17:36:40,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 1 times [2023-10-12 17:36:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205085080] [2023-10-12 17:36:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:36:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398794080] [2023-10-12 17:36:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 62054, now seen corresponding path program 1 times [2023-10-12 17:36:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241406227] [2023-10-12 17:36:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,962 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:40,962 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:40,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:40,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:40,963 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:40,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:40,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:40,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:40,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:40,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:40,972 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:36:40,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,998 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:40,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,017 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:36:41,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,025 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:36:41,049 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:36:41,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,051 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:36:41,052 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:36:41,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,076 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,080 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:36:41,080 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,081 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,081 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:41,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,082 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:41,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,121 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:36:41,123 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:36:41,129 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:36:41,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,147 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,185 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:36:41,186 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:36:41,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,192 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,192 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,192 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:41,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,198 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,227 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,228 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:36:41,246 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:36:41,288 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:36:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-10-12 17:36:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:36:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,295 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 52 transitions, 280 flow [2023-10-12 17:36:41,295 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:41,296 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 52 transitions, 280 flow [2023-10-12 17:36:41,299 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][24], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][12], 4:3A:[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0][22], 7:4A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][11], 18:5A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][19]][19:6A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][45]] [2023-10-12 17:36:41,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,299 INFO L124 PetriNetUnfolderBase]: 8/18 cut-off events. [2023-10-12 17:36:41,299 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:41,299 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,300 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 27#[L8]true [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 29#[L8-1, L17]true [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,300 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash 59625406, now seen corresponding path program 1 times [2023-10-12 17:36:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054552200] [2023-10-12 17:36:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,327 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:36:41,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054552200] [2023-10-12 17:36:41,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054552200] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918766699] [2023-10-12 17:36:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,330 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 2 times [2023-10-12 17:36:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822642858] [2023-10-12 17:36:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,346 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,346 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,346 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,346 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,347 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,347 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:36:41,361 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,361 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,363 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:36:41,365 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:36:41,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:36:41,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,392 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:36:41,417 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:36:41,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,451 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,454 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:36:41,455 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,455 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,456 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:36:41,475 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,476 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,478 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:36:41,481 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:36:41,482 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:36:41,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,509 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:36:41,510 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:36:41,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,511 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,511 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:41,514 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:36:41,515 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,552 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,552 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:36:41,554 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:36:41,599 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:36:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:36:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-10-12 17:36:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:41,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:36:41,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:41,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:41,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:41,606 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 24 places, 208 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:36:41,606 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:41,670 INFO L124 PetriNetUnfolderBase]: 61/135 cut-off events. [2023-10-12 17:36:41,671 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-10-12 17:36:41,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 135 events. 61/135 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 370 event pairs, 3 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 391. Up to 99 conditions per place. [2023-10-12 17:36:41,675 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 57 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2023-10-12 17:36:41,675 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 26 places, 68 transitions, 628 flow [2023-10-12 17:36:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:41,679 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 68 transitions, 628 flow [2023-10-12 17:36:41,679 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:41,679 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 68 transitions, 628 flow [2023-10-12 17:36:41,698 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][0], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][1], 3:3A:[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0][2], 6:4A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][4], 20:5A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][9], 42:6A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][19], 49:7A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][23], 60:8A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][29], 79:9A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][37], 94:10A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][47]][95:11A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][56]] [2023-10-12 17:36:41,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,699 INFO L124 PetriNetUnfolderBase]: 43/94 cut-off events. [2023-10-12 17:36:41,699 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-10-12 17:36:41,699 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,701 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 27#[L8]true [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 29#[L8-1, L17]true [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,701 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1748794022, now seen corresponding path program 1 times [2023-10-12 17:36:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222924602] [2023-10-12 17:36:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-10-12 17:36:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222924602] [2023-10-12 17:36:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222924602] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214427514] [2023-10-12 17:36:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,766 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 3 times [2023-10-12 17:36:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644774154] [2023-10-12 17:36:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,780 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,780 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,780 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,780 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,780 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,780 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,780 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,780 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,782 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:36:41,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,795 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:36:41,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:36:41,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,847 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,851 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,852 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:36:41,878 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,879 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:36:41,901 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:36:41,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,925 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,928 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:36:41,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,952 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,952 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:41,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,970 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,007 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,008 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:36:42,009 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:36:42,043 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:36:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-10-12 17:36:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-10-12 17:36:42,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:36:42,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,044 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:42,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,082 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,086 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:36:42,088 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:42,119 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:36:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-10-12 17:36:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-10-12 17:36:42,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:36:42,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,122 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:42,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,158 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,159 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:36:42,159 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:42,160 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-10-12 17:36:42,204 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 4 states and 109 transitions. [2023-10-12 17:36:42,206 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:36:42,214 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:36:42,214 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:36:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-10-12 17:36:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:36:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:36:42,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:36:42,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:36:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:36:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:36:42,217 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 616 transitions, 7000 flow. Second operand has 4 states, 4 states have (on average 2.0) 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) [2023-10-12 17:36:42,217 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:42,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:42,307 INFO L124 PetriNetUnfolderBase]: 134/332 cut-off events. [2023-10-12 17:36:42,308 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2023-10-12 17:36:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 332 events. 134/332 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1434 event pairs, 1 based on Foata normal form. 11/267 useless extension candidates. Maximal degree in co-relation 1454. Up to 267 conditions per place. [2023-10-12 17:36:42,312 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 138 selfloop transitions, 28 changer transitions 31/197 dead transitions. [2023-10-12 17:36:42,312 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 197 transitions, 2622 flow [2023-10-12 17:36:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:36:42,314 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 197 transitions, 2622 flow [2023-10-12 17:36:42,314 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:42,314 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 197 transitions, 2622 flow [2023-10-12 17:36:42,339 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][0], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][1], 3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][2], 5:4A:[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0][4], 13:5A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][9], 46:6A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][25], 87:7A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][46], 105:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][54], 124:9A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][67], 151:10A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][85], 186:11A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][103], 211:12A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][118], 236:13A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][136]][237:14A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][158]] [2023-10-12 17:36:42,341 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][0], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][1], 3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][2], 5:4A:[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0][4], 13:5A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][9], 46:6A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][25], 87:7A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][46], 105:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][54], 124:9A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][67], 151:10A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][85], 186:11A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][103], 210:12A:[52] L25-->onceEXIT: Formula: (not (= v_x_13 3)) InVars {x=v_x_13} OutVars{x=v_x_13} AuxVars[] AssignedVars[][117], 230:13A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][132], 253:14A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][144]][254:15A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][158]] [2023-10-12 17:36:42,342 ERROR L47 etriNetUnfolderRabin]: [1:1A:[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x][0], 2:2A:[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0][1], 3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][2], 5:4A:[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0][4], 13:5A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][9], 46:6A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][25], 87:7A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][46], 105:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][54], 124:9A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][67], 151:10A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][85], 186:11A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][103]][211:12A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][118], 236:13A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][136], 265:14A:[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][155], 266:15A:[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][169]] [2023-10-12 17:36:42,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:42,343 INFO L124 PetriNetUnfolderBase]: 105/265 cut-off events. [2023-10-12 17:36:42,343 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-10-12 17:36:42,343 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:42,344 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 27#[L8]true [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 29#[L8-1, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L8-1, L17]true [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:42,344 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 67#[L9, L26, L17]true [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:42,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 89374964, now seen corresponding path program 2 times [2023-10-12 17:36:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363045975] [2023-10-12 17:36:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2585251, now seen corresponding path program 1 times [2023-10-12 17:36:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341229567] [2023-10-12 17:36:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1023704554, now seen corresponding path program 3 times [2023-10-12 17:36:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830269446] [2023-10-12 17:36:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,530 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:42 BoogieIcfgContainer [2023-10-12 17:36:42,530 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:42,531 INFO L158 Benchmark]: Toolchain (without parser) took 2146.07ms. Allocated memory was 170.9MB in the beginning and 266.3MB in the end (delta: 95.4MB). Free memory was 122.8MB in the beginning and 108.5MB in the end (delta: 14.4MB). Peak memory consumption was 110.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,531 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 170.9MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:42,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.17ms. Allocated memory is still 170.9MB. Free memory was 122.6MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,532 INFO L158 Benchmark]: Boogie Preprocessor took 13.83ms. Allocated memory is still 170.9MB. Free memory was 121.1MB in the beginning and 120.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,534 INFO L158 Benchmark]: RCFGBuilder took 148.87ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 111.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,536 INFO L158 Benchmark]: BuchiAutomizer took 1955.59ms. Allocated memory was 170.9MB in the beginning and 266.3MB in the end (delta: 95.4MB). Free memory was 111.6MB in the beginning and 108.5MB in the end (delta: 3.1MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,541 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.22ms. Allocated memory is still 170.9MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.17ms. Allocated memory is still 170.9MB. Free memory was 122.6MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.83ms. Allocated memory is still 170.9MB. Free memory was 121.1MB in the beginning and 120.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 148.87ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 111.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1955.59ms. Allocated memory was 170.9MB in the beginning and 266.3MB in the end (delta: 95.4MB). Free memory was 111.6MB in the beginning and 108.5MB in the end (delta: 3.1MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One nondeterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 2622 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 125 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 82ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L9] FORK 0 fork 2 once(); VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L9] FORK 0 fork 2 once(); VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 16 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:36:42,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:36:42,760 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:36:42,963 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:36:43,165 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...