/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:31:44,111 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:31:44,162 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:31:44,193 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:31:44,193 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:31:44,194 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:31:44,195 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:31:44,195 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:31:44,196 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:31:44,199 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:31:44,200 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:31:44,200 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:31:44,200 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:31:44,201 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:31:44,202 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:31:44,202 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:31:44,202 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:31:44,202 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:31:44,203 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:31:44,203 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:31:44,203 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:31:44,203 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:31:44,203 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:31:44,204 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:31:44,204 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:31:44,204 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:31:44,204 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:31:44,204 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:31:44,205 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:31:44,205 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:31:44,206 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:31:44,206 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:31:44,206 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:31:44,207 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:31:44,208 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:31:44,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:31:44,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:31:44,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:31:44,430 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:31:44,431 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:31:44,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl [2023-10-12 17:31:44,432 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2023-10-12 17:31:44,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:31:44,471 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:31:44,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:44,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:31:44,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:31:44,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,496 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:31:44,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:44,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:31:44,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:31:44,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:31:44,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:31:44,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:31:44,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:31:44,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:31:44,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/1) ... [2023-10-12 17:31:44,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,579 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:31:44,594 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:31:44,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:31:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:31:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:31:44,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:31:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:31:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:31:44,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:31:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:31:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:31:44,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:31:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:31:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:31:44,628 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:31:44,677 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:31:44,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:31:44,771 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:31:44,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:31:44,794 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:31:44,796 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:44 BoogieIcfgContainer [2023-10-12 17:31:44,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:31:44,797 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:31:44,797 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:31:44,801 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:31:44,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:44,818 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:44" (1/2) ... [2023-10-12 17:31:44,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fb84ae and model type queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:31:44, skipping insertion in model container [2023-10-12 17:31:44,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:44,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:44" (2/2) ... [2023-10-12 17:31:44,826 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2023-10-12 17:31:44,889 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:31:44,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:31:44,942 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:31:44,943 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:31:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:31:44,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:31:44,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 35 transitions, 88 flow [2023-10-12 17:31:44,953 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:31:44,965 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:31:44,967 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:31:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 88 flow [2023-10-12 17:31:44,977 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:31:44,977 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:31:44,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:31:44,978 INFO L119 LiptonReduction]: Number of co-enabled transitions 478 [2023-10-12 17:31:45,638 INFO L134 LiptonReduction]: Checked pairs total: 397 [2023-10-12 17:31:45,638 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:31:45,652 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:31:45,653 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:31:45,653 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:31:45,653 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:31:45,653 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:31:45,653 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:31:45,653 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:31:45,654 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:31:45,654 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:31:45,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:45,665 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:31:45,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:45,667 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:45,670 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:31:45,670 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:31:45,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:45,672 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:31:45,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:45,672 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:45,677 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 55#[L81-1, L28-1]true [2023-10-12 17:31:45,677 INFO L750 eck$LassoCheckResult]: Loop: 55#[L81-1, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L81-1, L28-1]true [2023-10-12 17:31:45,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 123135, now seen corresponding path program 1 times [2023-10-12 17:31:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724111363] [2023-10-12 17:31:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:45,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:31:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310721247] [2023-10-12 17:31:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:45,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 3817330, now seen corresponding path program 1 times [2023-10-12 17:31:45,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699487634] [2023-10-12 17:31:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:45,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:45,963 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:45,965 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:45,965 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:45,965 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:45,965 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:45,965 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:45,965 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:45,965 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:45,965 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:31:45,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:45,966 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:45,980 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:31:45,991 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:31:45,994 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:31:46,002 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:31:46,076 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:46,079 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:46,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:46,093 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:31:46,100 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:31:46,106 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:31:46,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:46,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:46,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:46,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:46,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:46,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:46,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:46,137 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:31:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:46,139 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:31:46,150 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:31:46,150 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:31:46,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:46,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:46,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:46,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:46,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:46,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:46,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:46,183 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:31:46,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:46,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:46,187 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:31:46,189 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:31:46,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:46,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:46,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:46,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:46,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:46,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:46,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:46,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:46,234 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:31:46,234 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:31:46,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:46,239 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:31:46,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:46,274 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:31:46,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:46,285 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:46,285 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:31:46,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:31:46,295 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:31:46,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:46,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:46,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:46,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:46,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:46,357 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:31:46,397 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:31:46,398 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:46,558 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 403 transitions. [2023-10-12 17:31:46,559 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:46,562 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:31:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2023-10-12 17:31:46,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:31:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:46,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:31:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:46,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:31:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:46,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:31:46,650 INFO L124 PetriNetUnfolderBase]: 369/533 cut-off events. [2023-10-12 17:31:46,650 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-10-12 17:31:46,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 533 events. 369/533 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1735 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1049. Up to 167 conditions per place. [2023-10-12 17:31:46,655 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:31:46,660 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 37 places, 240 transitions, 1212 flow [2023-10-12 17:31:46,661 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 240 transitions, 1212 flow [2023-10-12 17:31:46,662 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:31:46,662 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:31:46,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:46,679 INFO L124 PetriNetUnfolderBase]: 39/63 cut-off events. [2023-10-12 17:31:46,679 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:31:46,679 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:46,679 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 108#[L82, L46-1, $Ultimate##0]true [2023-10-12 17:31:46,680 INFO L750 eck$LassoCheckResult]: Loop: 108#[L82, L46-1, $Ultimate##0]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 108#[L82, L46-1, $Ultimate##0]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 108#[L82, L46-1, $Ultimate##0]true [2023-10-12 17:31:46,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 3818320, now seen corresponding path program 1 times [2023-10-12 17:31:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833783724] [2023-10-12 17:31:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:46,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:46,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:46,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 1 times [2023-10-12 17:31:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:46,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848139300] [2023-10-12 17:31:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:46,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:46,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:46,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -625557008, now seen corresponding path program 1 times [2023-10-12 17:31:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528817379] [2023-10-12 17:31:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528817379] [2023-10-12 17:31:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528817379] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:31:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030884047] [2023-10-12 17:31:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:31:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:31:47,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 240 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 2.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:31:47,005 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:47,093 INFO L124 PetriNetUnfolderBase]: 459/661 cut-off events. [2023-10-12 17:31:47,093 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-10-12 17:31:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 661 events. 459/661 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2173 event pairs, 5 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1869. Up to 490 conditions per place. [2023-10-12 17:31:47,100 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 110 selfloop transitions, 8 changer transitions 11/129 dead transitions. [2023-10-12 17:31:47,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,145 INFO L124 PetriNetUnfolderBase]: 459/661 cut-off events. [2023-10-12 17:31:47,145 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-10-12 17:31:47,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 661 events. 459/661 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2170 event pairs, 5 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1869. Up to 490 conditions per place. [2023-10-12 17:31:47,146 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,148 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:31:47,149 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,149 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:31:47,150 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:31:47,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:47,161 INFO L124 PetriNetUnfolderBase]: 86/134 cut-off events. [2023-10-12 17:31:47,161 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-10-12 17:31:47,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:47,162 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 125#[$Ultimate##0, L83, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 127#[$Ultimate##0, L83, L66-1, $Ultimate##0]true [2023-10-12 17:31:47,162 INFO L750 eck$LassoCheckResult]: Loop: 127#[$Ultimate##0, L83, L66-1, $Ultimate##0]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 127#[$Ultimate##0, L83, L66-1, $Ultimate##0]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 127#[$Ultimate##0, L83, L66-1, $Ultimate##0]true [2023-10-12 17:31:47,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 118367409, now seen corresponding path program 1 times [2023-10-12 17:31:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847059688] [2023-10-12 17:31:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:47,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 5697, now seen corresponding path program 1 times [2023-10-12 17:31:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101802524] [2023-10-12 17:31:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:47,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2081935089, now seen corresponding path program 1 times [2023-10-12 17:31:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332067644] [2023-10-12 17:31:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332067644] [2023-10-12 17:31:47,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332067644] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:31:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033282615] [2023-10-12 17:31:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:31:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:31:47,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 129 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:47,339 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:47,436 INFO L124 PetriNetUnfolderBase]: 536/815 cut-off events. [2023-10-12 17:31:47,437 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2023-10-12 17:31:47,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 815 events. 536/815 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3087 event pairs, 6 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 3043. Up to 698 conditions per place. [2023-10-12 17:31:47,443 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 140 selfloop transitions, 6 changer transitions 18/164 dead transitions. [2023-10-12 17:31:47,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,498 INFO L124 PetriNetUnfolderBase]: 536/815 cut-off events. [2023-10-12 17:31:47,499 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2023-10-12 17:31:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 815 events. 536/815 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3080 event pairs, 6 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 3043. Up to 698 conditions per place. [2023-10-12 17:31:47,502 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,505 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:31:47,507 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:31:47,508 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:31:47,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:47,531 INFO L124 PetriNetUnfolderBase]: 192/289 cut-off events. [2023-10-12 17:31:47,531 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-10-12 17:31:47,531 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:47,532 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 144#[$Ultimate##0, L82, L28-1]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 146#[L82, L28-1, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 148#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 148#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 148#[thread1EXIT, L82, L46-1]true [2023-10-12 17:31:47,532 INFO L750 eck$LassoCheckResult]: Loop: 148#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 148#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 148#[thread1EXIT, L82, L46-1]true [2023-10-12 17:31:47,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 91554404, now seen corresponding path program 1 times [2023-10-12 17:31:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241018913] [2023-10-12 17:31:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:47,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:31:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:47,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:47,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241018913] [2023-10-12 17:31:47,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241018913] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:47,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723398750] [2023-10-12 17:31:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:47,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:47,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:31:47,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-10-12 17:31:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:47,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:47,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:47,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:31:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723398750] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:31:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-10-12 17:31:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246571888] [2023-10-12 17:31:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:47,760 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:31:47,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 2 times [2023-10-12 17:31:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183899764] [2023-10-12 17:31:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:47,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:31:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:31:47,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 164 transitions, 1447 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:47,936 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:47,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:48,110 INFO L124 PetriNetUnfolderBase]: 1008/1580 cut-off events. [2023-10-12 17:31:48,110 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2023-10-12 17:31:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1580 events. 1008/1580 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7289 event pairs, 11 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 7282. Up to 1463 conditions per place. [2023-10-12 17:31:48,124 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 227 selfloop transitions, 31 changer transitions 39/297 dead transitions. [2023-10-12 17:31:48,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,263 INFO L124 PetriNetUnfolderBase]: 1008/1580 cut-off events. [2023-10-12 17:31:48,263 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2023-10-12 17:31:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1580 events. 1008/1580 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7323 event pairs, 11 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 7282. Up to 1463 conditions per place. [2023-10-12 17:31:48,265 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,270 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:31:48,272 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,272 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:31:48,272 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:31:48,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:48,321 INFO L124 PetriNetUnfolderBase]: 382/583 cut-off events. [2023-10-12 17:31:48,321 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-10-12 17:31:48,321 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:48,322 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:31:48,323 INFO L750 eck$LassoCheckResult]: Loop: 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:31:48,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1454969138, now seen corresponding path program 1 times [2023-10-12 17:31:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6940801] [2023-10-12 17:31:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:48,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:48,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:48,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 3 times [2023-10-12 17:31:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233043610] [2023-10-12 17:31:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:48,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:48,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:48,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1934001646, now seen corresponding path program 2 times [2023-10-12 17:31:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939423761] [2023-10-12 17:31:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939423761] [2023-10-12 17:31:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939423761] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435847120] [2023-10-12 17:31:48,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:31:48,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:48,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:48,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:31:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:31:48,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:31:48,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:48,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:31:48,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:48,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:31:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435847120] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:31:48,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:31:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-10-12 17:31:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360267128] [2023-10-12 17:31:48,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:31:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:31:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:31:48,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 297 transitions, 3237 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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:31:48,797 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:48,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:49,108 INFO L124 PetriNetUnfolderBase]: 1653/2607 cut-off events. [2023-10-12 17:31:49,108 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-10-12 17:31:49,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16312 conditions, 2607 events. 1653/2607 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13402 event pairs, 17 based on Foata normal form. 0/1812 useless extension candidates. Maximal degree in co-relation 14345. Up to 2490 conditions per place. [2023-10-12 17:31:49,130 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 348 selfloop transitions, 64 changer transitions 67/479 dead transitions. [2023-10-12 17:31:49,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,416 INFO L124 PetriNetUnfolderBase]: 1653/2607 cut-off events. [2023-10-12 17:31:49,416 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-10-12 17:31:49,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16312 conditions, 2607 events. 1653/2607 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13363 event pairs, 17 based on Foata normal form. 0/1812 useless extension candidates. Maximal degree in co-relation 14345. Up to 2490 conditions per place. [2023-10-12 17:31:49,419 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,427 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:31:49,430 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,430 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:31:49,430 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:31:49,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:49,535 INFO L124 PetriNetUnfolderBase]: 566/876 cut-off events. [2023-10-12 17:31:49,535 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2023-10-12 17:31:49,535 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:49,536 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 125#[$Ultimate##0, L83, $Ultimate##0, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 276#[$Ultimate##0, L28-1, L83, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 278#[L28-1, L83, L46-1, $Ultimate##0]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 278#[L28-1, L83, L46-1, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:31:49,537 INFO L750 eck$LassoCheckResult]: Loop: 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:31:49,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1958735452, now seen corresponding path program 1 times [2023-10-12 17:31:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448005847] [2023-10-12 17:31:49,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:49,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:49,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:49,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 5697, now seen corresponding path program 2 times [2023-10-12 17:31:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203919329] [2023-10-12 17:31:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:49,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:49,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:49,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1149088988, now seen corresponding path program 2 times [2023-10-12 17:31:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068439263] [2023-10-12 17:31:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:49,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068439263] [2023-10-12 17:31:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068439263] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:49,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:49,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:31:49,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021457278] [2023-10-12 17:31:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:31:49,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:31:49,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 479 transitions, 6189 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:31:49,753 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:49,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:50,344 INFO L124 PetriNetUnfolderBase]: 2767/4491 cut-off events. [2023-10-12 17:31:50,345 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2023-10-12 17:31:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32523 conditions, 4491 events. 2767/4491 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26399 event pairs, 19 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 27186. Up to 4374 conditions per place. [2023-10-12 17:31:50,383 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 678 selfloop transitions, 82 changer transitions 147/907 dead transitions. [2023-10-12 17:31:50,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:50,991 INFO L124 PetriNetUnfolderBase]: 2767/4491 cut-off events. [2023-10-12 17:31:50,991 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2023-10-12 17:31:50,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32523 conditions, 4491 events. 2767/4491 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26403 event pairs, 19 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 27186. Up to 4374 conditions per place. [2023-10-12 17:31:50,995 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:51,014 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:51,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:31:51,015 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:51,015 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:31:51,015 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:31:51,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:51,235 INFO L124 PetriNetUnfolderBase]: 969/1508 cut-off events. [2023-10-12 17:31:51,235 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2023-10-12 17:31:51,235 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:51,235 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 55#[L81-1, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L81-1, L28-1]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:31:51,236 INFO L750 eck$LassoCheckResult]: Loop: 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:31:51,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1235337716, now seen corresponding path program 3 times [2023-10-12 17:31:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:51,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90602592] [2023-10-12 17:31:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:51,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:51,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:51,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:51,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 4 times [2023-10-12 17:31:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490904075] [2023-10-12 17:31:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:51,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:51,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:51,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1748576148, now seen corresponding path program 4 times [2023-10-12 17:31:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782687117] [2023-10-12 17:31:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782687117] [2023-10-12 17:31:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782687117] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725767665] [2023-10-12 17:31:51,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:31:51,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:51,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:51,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:31:51,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-10-12 17:31:51,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:31:51,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:51,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:31:51,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:51,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:31:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725767665] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:31:51,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:31:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-10-12 17:31:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463095964] [2023-10-12 17:31:51,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:31:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-10-12 17:31:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:31:51,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 907 transitions, 13526 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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:31:51,588 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:51,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:52,852 INFO L124 PetriNetUnfolderBase]: 4274/6941 cut-off events. [2023-10-12 17:31:52,852 INFO L125 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2023-10-12 17:31:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57172 conditions, 6941 events. 4274/6941 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43755 event pairs, 24 based on Foata normal form. 0/4759 useless extension candidates. Maximal degree in co-relation 48085. Up to 6824 conditions per place. [2023-10-12 17:31:52,985 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 939 selfloop transitions, 245 changer transitions 236/1420 dead transitions. [2023-10-12 17:31:52,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:52,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:54,116 INFO L124 PetriNetUnfolderBase]: 4274/6941 cut-off events. [2023-10-12 17:31:54,117 INFO L125 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2023-10-12 17:31:54,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57172 conditions, 6941 events. 4274/6941 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43841 event pairs, 24 based on Foata normal form. 0/4759 useless extension candidates. Maximal degree in co-relation 48085. Up to 6824 conditions per place. [2023-10-12 17:31:54,123 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:54,144 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-10-12 17:31:54,145 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:54,145 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:31:54,145 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:31:54,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:54,465 INFO L124 PetriNetUnfolderBase]: 1377/2153 cut-off events. [2023-10-12 17:31:54,465 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2023-10-12 17:31:54,465 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:54,466 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 125#[$Ultimate##0, L83, $Ultimate##0, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 276#[$Ultimate##0, L28-1, L83, $Ultimate##0]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 276#[$Ultimate##0, L28-1, L83, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 278#[L28-1, L83, L46-1, $Ultimate##0]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 278#[L28-1, L83, L46-1, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:31:54,466 INFO L750 eck$LassoCheckResult]: Loop: 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:31:54,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 573010550, now seen corresponding path program 3 times [2023-10-12 17:31:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564743326] [2023-10-12 17:31:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:54,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:54,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:54,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 5697, now seen corresponding path program 3 times [2023-10-12 17:31:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309861641] [2023-10-12 17:31:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:54,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:54,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:54,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 907329398, now seen corresponding path program 4 times [2023-10-12 17:31:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041820930] [2023-10-12 17:31:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:31:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041820930] [2023-10-12 17:31:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041820930] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348895511] [2023-10-12 17:31:54,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:31:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:54,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:54,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:31:54,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-10-12 17:31:54,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:31:54,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:54,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:31:54,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:31:54,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:31:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:31:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348895511] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:31:54,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:31:54,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:31:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531828642] [2023-10-12 17:31:54,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:31:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:31:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:31:54,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 1420 transitions, 24004 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:31:54,762 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:54,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:56,929 INFO L124 PetriNetUnfolderBase]: 7033/11522 cut-off events. [2023-10-12 17:31:56,929 INFO L125 PetriNetUnfolderBase]: For 3831/3831 co-relation queries the response was YES. [2023-10-12 17:31:56,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 11522 events. 7033/11522 cut-off events. For 3831/3831 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 79830 event pairs, 22 based on Foata normal form. 0/7799 useless extension candidates. Maximal degree in co-relation 90657. Up to 11405 conditions per place. [2023-10-12 17:31:57,024 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 1733 selfloop transitions, 328 changer transitions 437/2498 dead transitions. [2023-10-12 17:31:57,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:31:57,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:32:00,364 INFO L124 PetriNetUnfolderBase]: 7033/11522 cut-off events. [2023-10-12 17:32:00,364 INFO L125 PetriNetUnfolderBase]: For 3831/3831 co-relation queries the response was YES. [2023-10-12 17:32:00,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 11522 events. 7033/11522 cut-off events. For 3831/3831 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 79783 event pairs, 22 based on Foata normal form. 0/7799 useless extension candidates. Maximal degree in co-relation 90657. Up to 11405 conditions per place. [2023-10-12 17:32:00,374 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:32:00,418 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:32:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:32:00,421 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:32:00,421 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:32:00,421 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:32:01,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:01,387 INFO L124 PetriNetUnfolderBase]: 2315/3638 cut-off events. [2023-10-12 17:32:01,387 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2023-10-12 17:32:01,387 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:01,388 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 55#[L81-1, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L81-1, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L81-1, L28-1]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 144#[$Ultimate##0, L82, L28-1]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:32:01,388 INFO L750 eck$LassoCheckResult]: Loop: 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 146#[L82, L28-1, L46-1]true [2023-10-12 17:32:01,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1575333902, now seen corresponding path program 5 times [2023-10-12 17:32:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774107418] [2023-10-12 17:32:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:01,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:01,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:01,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 5 times [2023-10-12 17:32:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143518878] [2023-10-12 17:32:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:01,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:01,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:01,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2067396398, now seen corresponding path program 6 times [2023-10-12 17:32:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732002917] [2023-10-12 17:32:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:32:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732002917] [2023-10-12 17:32:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732002917] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:32:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200704575] [2023-10-12 17:32:01,499 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-10-12 17:32:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:32:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:01,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:32:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:32:01,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-10-12 17:32:01,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:32:01,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2023-10-12 17:32:01,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:01,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:32:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:01,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200704575] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:32:01,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:32:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-10-12 17:32:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749649314] [2023-10-12 17:32:01,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:32:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:32:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-10-12 17:32:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2023-10-12 17:32:01,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 2498 transitions, 47175 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:32:01,779 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:32:01,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:32:07,277 INFO L124 PetriNetUnfolderBase]: 11207/18252 cut-off events. [2023-10-12 17:32:07,277 INFO L125 PetriNetUnfolderBase]: For 6096/6096 co-relation queries the response was YES. [2023-10-12 17:32:07,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186524 conditions, 18252 events. 11207/18252 cut-off events. For 6096/6096 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 132768 event pairs, 32 based on Foata normal form. 0/12192 useless extension candidates. Maximal degree in co-relation 159699. Up to 18135 conditions per place. [2023-10-12 17:32:07,427 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 2497 selfloop transitions, 790 changer transitions 699/3986 dead transitions. [2023-10-12 17:32:07,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:07,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:15,761 INFO L124 PetriNetUnfolderBase]: 11207/18252 cut-off events. [2023-10-12 17:32:15,761 INFO L125 PetriNetUnfolderBase]: For 6096/6096 co-relation queries the response was YES. [2023-10-12 17:32:15,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186524 conditions, 18252 events. 11207/18252 cut-off events. For 6096/6096 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 132877 event pairs, 32 based on Foata normal form. 0/12192 useless extension candidates. Maximal degree in co-relation 159699. Up to 18135 conditions per place. [2023-10-12 17:32:15,773 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:15,841 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-10-12 17:32:15,842 INFO L430 stractBuchiCegarLoop]: Abstraction has has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:15,842 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:32:15,842 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 places, 3986 transitions, 83188 flow [2023-10-12 17:32:17,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:17,848 INFO L124 PetriNetUnfolderBase]: 2914/4598 cut-off events. [2023-10-12 17:32:17,848 INFO L125 PetriNetUnfolderBase]: For 1438/1438 co-relation queries the response was YES. [2023-10-12 17:32:17,848 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:17,849 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 106#[$Ultimate##0, L82, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 125#[$Ultimate##0, L83, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 127#[$Ultimate##0, L83, L66-1, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 625#[L83, L66-1, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 281#[L28-1, L66-1, L83, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 281#[L28-1, L66-1, L83, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 281#[L28-1, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:32:17,849 INFO L750 eck$LassoCheckResult]: Loop: 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 281#[L28-1, L66-1, L83, L46-1]true [2023-10-12 17:32:17,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 6047182, now seen corresponding path program 5 times [2023-10-12 17:32:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759096658] [2023-10-12 17:32:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:17,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 5697, now seen corresponding path program 4 times [2023-10-12 17:32:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435744344] [2023-10-12 17:32:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:17,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1516379342, now seen corresponding path program 6 times [2023-10-12 17:32:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443456452] [2023-10-12 17:32:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:17,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:18,512 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:18,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:18,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:18,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:18,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:18,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:18,513 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:18,513 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:18,513 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:32:18,513 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:18,513 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:18,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,531 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,536 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,538 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,540 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,542 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,545 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:18,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:32:19,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:19,358 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,365 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:32:19,366 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:32:19,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,386 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:32:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,388 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:32:19,390 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:32:19,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:32:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,431 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:32:19,442 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:32:19,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,455 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:32:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,458 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:32:19,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:32:19,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,535 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:32:19,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,561 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:32:19,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,577 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:32:19,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:19,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:32:19,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:32:19,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:19,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:19,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:19,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:19,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:19,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:19,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:19,633 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:32:19,633 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:32:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:19,636 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:19,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:32:19,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:19,644 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:19,644 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:19,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:32:19,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:19,666 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2023-10-12 17:32:19,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:19,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:19,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:19,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:19,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:32:19,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:32:19,737 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:32:19,827 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 6 states and 393 transitions. [2023-10-12 17:32:19,827 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:20,309 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:32:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:32:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2023-10-12 17:32:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:32:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 16 letters. Loop has 2 letters. [2023-10-12 17:32:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 14 letters. Loop has 4 letters. [2023-10-12 17:32:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:20,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 53092 transitions, 1216576 flow [2023-10-12 17:32:23,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 Received shutdown request... [2023-10-12 17:35:35,998 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:35,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:35,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:35,999 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:35,998 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:35,998 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:36,005 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:35:36,006 INFO L430 stractBuchiCegarLoop]: Abstraction has has 73 places, 53092 transitions, 1216576 flow [2023-10-12 17:35:36,006 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:35:36,006 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 73 places, 53092 transitions, 1216576 flow [2023-10-12 17:35:36,043 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:35:36,046 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:35:36 BoogieIcfgContainer [2023-10-12 17:35:36,046 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:35:36,047 INFO L158 Benchmark]: Toolchain (without parser) took 231575.80ms. Allocated memory was 189.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 141.5MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-10-12 17:35:36,047 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 189.8MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:35:36,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.36ms. Allocated memory is still 189.8MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:35:36,047 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 189.8MB. Free memory was 140.0MB in the beginning and 138.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:35:36,048 INFO L158 Benchmark]: RCFGBuilder took 267.45ms. Allocated memory is still 189.8MB. Free memory was 138.8MB in the beginning and 127.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:35:36,048 INFO L158 Benchmark]: BuchiAutomizer took 231249.21ms. Allocated memory was 189.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 127.6MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-10-12 17:35:36,049 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.27ms. Allocated memory is still 189.8MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.36ms. Allocated memory is still 189.8MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 189.8MB. Free memory was 140.0MB in the beginning and 138.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 267.45ms. Allocated memory is still 189.8MB. Free memory was 138.8MB in the beginning and 127.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 231249.21ms. Allocated memory was 189.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 127.6MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.1GB. 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 10 terminating modules (8 trivial, 2 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1216576 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 231.1s and 11 iterations. TraceHistogramMax:0. Analysis of lassos took 5.0s. Construction of modules took 0.4s. Büchi inclusion checks took 25.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 126 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc7 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital102 mio100 ax100 hnf100 lsp65 ukn98 mio100 lsp85 div100 bol103 ite100 ukn100 eq185 hnf90 smp100 dnf237 smp79 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 42 PlacesBefore, 25 PlacesAfterwards, 35 TransitionsBefore, 18 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 295, independent conditional: 0, independent unconditional: 295, 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: 301, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown