/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-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:08,190 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:08,239 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:30:08,265 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:08,265 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:08,265 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:08,266 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:08,267 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:08,267 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:08,270 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:08,270 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:08,270 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:08,270 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:08,271 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:08,272 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:08,272 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:08,272 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:08,272 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:08,273 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:08,273 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:08,273 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:08,273 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:08,274 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:08,274 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:08,275 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:08,275 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:08,275 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:08,275 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:08,275 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:08,275 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:08,276 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:08,276 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:08,277 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:08,278 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:08,278 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:30:08,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:08,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:08,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:08,528 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:08,529 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:08,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2023-10-12 17:30:08,531 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2023-10-12 17:30:08,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:08,563 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:08,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:08,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:08,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:08,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,591 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:08,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:08,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:08,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:08,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:08,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:08,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:08,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:08,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:08,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/1) ... [2023-10-12 17:30:08,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:08,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:08,662 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:30:08,698 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:30:08,718 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:08,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:08,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:08,720 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:30:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:30:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:30:08,721 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:30:08,769 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:08,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:08,883 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:08,905 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:08,906 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:08,907 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:08 BoogieIcfgContainer [2023-10-12 17:30:08,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:08,908 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:08,908 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:08,911 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:08,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:08,912 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:08" (1/2) ... [2023-10-12 17:30:08,913 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f3d0024 and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:08, skipping insertion in model container [2023-10-12 17:30:08,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:08,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:08" (2/2) ... [2023-10-12 17:30:08,914 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2023-10-12 17:30:08,965 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:30:08,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:30:09,044 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:30:09,044 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:09,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:30:09,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:30:09,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:30:09,053 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:09,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:30:09,082 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:30:09,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:30:09,091 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:30:09,092 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:09,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:30:09,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:30:09,762 INFO L134 LiptonReduction]: Checked pairs total: 535 [2023-10-12 17:30:09,762 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-10-12 17:30:09,771 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:09,771 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:09,771 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:09,772 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:09,772 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:09,772 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:09,772 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:09,772 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:09,772 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:30:09,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:09,776 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:30:09,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:09,776 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:09,778 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:09,778 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:30:09,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:09,779 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:30:09,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:09,779 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:09,783 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 59#[L32-1, L89-1]true [2023-10-12 17:30:09,783 INFO L750 eck$LassoCheckResult]: Loop: 59#[L32-1, L89-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 59#[L32-1, L89-1]true [2023-10-12 17:30:09,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2023-10-12 17:30:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707910350] [2023-10-12 17:30:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:09,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 194, now seen corresponding path program 1 times [2023-10-12 17:30:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905470530] [2023-10-12 17:30:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:09,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 4094364, now seen corresponding path program 1 times [2023-10-12 17:30:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985493726] [2023-10-12 17:30:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:10,003 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:10,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:10,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:10,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:10,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:10,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:10,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:10,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:10,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:10,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:10,014 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:30:10,025 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:30:10,034 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:30:10,037 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:30:10,038 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:10,040 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:10,042 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:10,115 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:10,118 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,129 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:30:10,135 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:30:10,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:10,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:10,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:10,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:10,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:10,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:10,153 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:30:10,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:10,166 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:30:10,167 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:30:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,170 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:30:10,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:10,196 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:10,197 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:10,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:30:10,198 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:30:10,222 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:30:10,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:30:10,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:10,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:10,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:10,274 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:30:10,294 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:30:10,295 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:30:10,433 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 459 transitions. [2023-10-12 17:30:10,434 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:10,436 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:10,453 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:30:10,456 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:30:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 266 transitions. [2023-10-12 17:30:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:30:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:30:10,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:30:10,502 INFO L124 PetriNetUnfolderBase]: 369/533 cut-off events. [2023-10-12 17:30:10,502 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-10-12 17:30:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 533 events. 369/533 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1664 event pairs, 25 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 928. Up to 167 conditions per place. [2023-10-12 17:30:10,503 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:30:10,507 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 37 places, 240 transitions, 1212 flow [2023-10-12 17:30:10,507 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 240 transitions, 1212 flow [2023-10-12 17:30:10,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:10,507 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 places, 240 transitions, 1212 flow [2023-10-12 17:30:10,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:10,512 INFO L124 PetriNetUnfolderBase]: 41/63 cut-off events. [2023-10-12 17:30:10,513 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:30:10,513 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:10,513 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 112#[$Ultimate##0, L90, L32-1]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:10,513 INFO L750 eck$LassoCheckResult]: Loop: 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:10,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -359352149, now seen corresponding path program 1 times [2023-10-12 17:30:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392102180] [2023-10-12 17:30:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,557 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:30:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392102180] [2023-10-12 17:30:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392102180] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:30:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770099783] [2023-10-12 17:30:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:10,560 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:30:10,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 6241, now seen corresponding path program 1 times [2023-10-12 17:30:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649143798] [2023-10-12 17:30:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:10,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:10,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 240 transitions, 1212 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:10,755 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:10,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:10,801 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:30:10,838 INFO L124 PetriNetUnfolderBase]: 459/661 cut-off events. [2023-10-12 17:30:10,838 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-10-12 17:30:10,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 661 events. 459/661 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2167 event pairs, 6 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:30:10,843 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 110 selfloop transitions, 8 changer transitions 11/129 dead transitions. [2023-10-12 17:30:10,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,870 INFO L124 PetriNetUnfolderBase]: 459/661 cut-off events. [2023-10-12 17:30:10,870 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-10-12 17:30:10,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 661 events. 459/661 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2157 event pairs, 6 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:30:10,871 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,872 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:10,873 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,873 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:10,873 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 129 transitions, 867 flow [2023-10-12 17:30:10,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:10,882 INFO L124 PetriNetUnfolderBase]: 92/141 cut-off events. [2023-10-12 17:30:10,882 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:30:10,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:10,883 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 112#[$Ultimate##0, L90, L32-1]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 131#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 133#[$Ultimate##0, L73-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 133#[$Ultimate##0, L73-1, L32-1, L91]true [2023-10-12 17:30:10,883 INFO L750 eck$LassoCheckResult]: Loop: 133#[$Ultimate##0, L73-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 133#[$Ultimate##0, L73-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 133#[$Ultimate##0, L73-1, L32-1, L91]true [2023-10-12 17:30:10,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1744971543, now seen corresponding path program 1 times [2023-10-12 17:30:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605080037] [2023-10-12 17:30:10,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,907 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:30:10,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605080037] [2023-10-12 17:30:10,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605080037] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:30:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619037224] [2023-10-12 17:30:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:10,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:30:10,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 1 times [2023-10-12 17:30:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467434031] [2023-10-12 17:30:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:11,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 129 transitions, 867 flow. Second operand has 3 states, 2 states have (on average 3.5) 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:30:11,024 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:11,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:11,089 INFO L124 PetriNetUnfolderBase]: 536/815 cut-off events. [2023-10-12 17:30:11,089 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2023-10-12 17:30:11,090 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 3069 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:30:11,094 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 140 selfloop transitions, 6 changer transitions 18/164 dead transitions. [2023-10-12 17:30:11,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,146 INFO L124 PetriNetUnfolderBase]: 536/815 cut-off events. [2023-10-12 17:30:11,146 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2023-10-12 17:30:11,147 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 3076 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:30:11,147 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,149 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:11,150 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,150 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:11,150 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 164 transitions, 1447 flow [2023-10-12 17:30:11,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:11,163 INFO L124 PetriNetUnfolderBase]: 192/289 cut-off events. [2023-10-12 17:30:11,164 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-10-12 17:30:11,164 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:11,164 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 112#[$Ultimate##0, L90, L32-1]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 114#[L90, L52-1, L32-1]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [2023-10-12 17:30:11,164 INFO L750 eck$LassoCheckResult]: Loop: 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [2023-10-12 17:30:11,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1740027190, now seen corresponding path program 1 times [2023-10-12 17:30:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542154547] [2023-10-12 17:30:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:11,217 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:30:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:11,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542154547] [2023-10-12 17:30:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542154547] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:30:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249376148] [2023-10-12 17:30:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:11,219 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:30:11,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash 6241, now seen corresponding path program 2 times [2023-10-12 17:30:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763034433] [2023-10-12 17:30:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:30:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:30:11,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 164 transitions, 1447 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:30:11,396 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:11,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:11,548 INFO L124 PetriNetUnfolderBase]: 1008/1580 cut-off events. [2023-10-12 17:30:11,549 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-10-12 17:30:11,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1580 events. 1008/1580 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7276 event pairs, 10 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 6710. Up to 1463 conditions per place. [2023-10-12 17:30:11,557 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 227 selfloop transitions, 31 changer transitions 39/297 dead transitions. [2023-10-12 17:30:11,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,658 INFO L124 PetriNetUnfolderBase]: 1008/1580 cut-off events. [2023-10-12 17:30:11,659 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-10-12 17:30:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1580 events. 1008/1580 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7274 event pairs, 10 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 6710. Up to 1463 conditions per place. [2023-10-12 17:30:11,660 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,663 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:30:11,665 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,665 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:30:11,665 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 297 transitions, 3237 flow [2023-10-12 17:30:11,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:11,701 INFO L124 PetriNetUnfolderBase]: 363/553 cut-off events. [2023-10-12 17:30:11,701 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-10-12 17:30:11,701 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:11,702 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 59#[L32-1, L89-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 59#[L32-1, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:11,702 INFO L750 eck$LassoCheckResult]: Loop: 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:11,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 49294116, now seen corresponding path program 1 times [2023-10-12 17:30:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816782118] [2023-10-12 17:30:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 6241, now seen corresponding path program 3 times [2023-10-12 17:30:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755353794] [2023-10-12 17:30:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash 127010500, now seen corresponding path program 2 times [2023-10-12 17:30:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599949150] [2023-10-12 17:30:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:11,817 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:30:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599949150] [2023-10-12 17:30:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599949150] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956235844] [2023-10-12 17:30:11,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,837 INFO L229 MonitoredProcess]: Starting monitored process 4 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:30:11,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-10-12 17:30:11,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:11,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:11,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:30:11,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:11,915 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:30:11,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:11,942 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:30:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956235844] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:11,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-10-12 17:30:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668906566] [2023-10-12 17:30:11,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:30:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:30:12,089 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.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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:30:12,089 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:12,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:12,329 INFO L124 PetriNetUnfolderBase]: 1653/2607 cut-off events. [2023-10-12 17:30:12,329 INFO L125 PetriNetUnfolderBase]: For 667/667 co-relation queries the response was YES. [2023-10-12 17:30:12,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16312 conditions, 2607 events. 1653/2607 cut-off events. For 667/667 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13410 event pairs, 14 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:30:12,344 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 348 selfloop transitions, 64 changer transitions 67/479 dead transitions. [2023-10-12 17:30:12,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,539 INFO L124 PetriNetUnfolderBase]: 1653/2607 cut-off events. [2023-10-12 17:30:12,539 INFO L125 PetriNetUnfolderBase]: For 667/667 co-relation queries the response was YES. [2023-10-12 17:30:12,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16312 conditions, 2607 events. 1653/2607 cut-off events. For 667/667 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13434 event pairs, 14 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:30:12,541 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,549 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:30:12,550 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,550 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:12,550 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 479 transitions, 6189 flow [2023-10-12 17:30:12,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:12,610 INFO L124 PetriNetUnfolderBase]: 591/910 cut-off events. [2023-10-12 17:30:12,610 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2023-10-12 17:30:12,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:12,610 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 255#[$Ultimate##0, L90, L52-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 114#[L90, L52-1, L32-1]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 258#[L52-1, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 258#[L52-1, L32-1, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:12,610 INFO L750 eck$LassoCheckResult]: Loop: 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:12,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1452030169, now seen corresponding path program 1 times [2023-10-12 17:30:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355291140] [2023-10-12 17:30:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:12,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 2 times [2023-10-12 17:30:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326378226] [2023-10-12 17:30:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:12,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 463383975, now seen corresponding path program 2 times [2023-10-12 17:30:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745192607] [2023-10-12 17:30:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:12,656 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:30:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745192607] [2023-10-12 17:30:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745192607] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:12,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:30:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171757774] [2023-10-12 17:30:12,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:30:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:30:12,777 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:30:12,777 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:12,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:13,224 INFO L124 PetriNetUnfolderBase]: 2767/4491 cut-off events. [2023-10-12 17:30:13,224 INFO L125 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2023-10-12 17:30:13,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32523 conditions, 4491 events. 2767/4491 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26349 event pairs, 16 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 28538. Up to 4374 conditions per place. [2023-10-12 17:30:13,255 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 678 selfloop transitions, 82 changer transitions 147/907 dead transitions. [2023-10-12 17:30:13,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,745 INFO L124 PetriNetUnfolderBase]: 2767/4491 cut-off events. [2023-10-12 17:30:13,745 INFO L125 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2023-10-12 17:30:13,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32523 conditions, 4491 events. 2767/4491 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26351 event pairs, 16 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 28538. Up to 4374 conditions per place. [2023-10-12 17:30:13,749 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,761 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:30:13,762 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,762 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:30:13,762 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 907 transitions, 13526 flow [2023-10-12 17:30:13,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:13,918 INFO L124 PetriNetUnfolderBase]: 977/1524 cut-off events. [2023-10-12 17:30:13,918 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2023-10-12 17:30:13,918 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:13,918 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:13,918 INFO L750 eck$LassoCheckResult]: Loop: 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 114#[L90, L52-1, L32-1]true [2023-10-12 17:30:13,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1822763378, now seen corresponding path program 3 times [2023-10-12 17:30:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694903410] [2023-10-12 17:30:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:13,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 6241, now seen corresponding path program 4 times [2023-10-12 17:30:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472439881] [2023-10-12 17:30:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:13,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash 671055790, now seen corresponding path program 4 times [2023-10-12 17:30:13,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410612223] [2023-10-12 17:30:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:13,996 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:30:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410612223] [2023-10-12 17:30:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410612223] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250816212] [2023-10-12 17:30:13,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:30:13,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:13,998 INFO L229 MonitoredProcess]: Starting monitored process 5 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:30:14,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-10-12 17:30:14,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:30:14,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:14,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:30:14,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:14,076 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:30:14,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:14,107 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:30:14,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250816212] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:14,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-10-12 17:30:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844776240] [2023-10-12 17:30:14,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-10-12 17:30:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:30:14,245 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.5) internal successors, (20), 7 states have internal predecessors, (20), 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:30:14,245 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:14,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:15,192 INFO L124 PetriNetUnfolderBase]: 4274/6941 cut-off events. [2023-10-12 17:30:15,193 INFO L125 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2023-10-12 17:30:15,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57172 conditions, 6941 events. 4274/6941 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 43737 event pairs, 22 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:30:15,249 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 939 selfloop transitions, 245 changer transitions 236/1420 dead transitions. [2023-10-12 17:30:15,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:15,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:16,400 INFO L124 PetriNetUnfolderBase]: 4274/6941 cut-off events. [2023-10-12 17:30:16,400 INFO L125 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2023-10-12 17:30:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57172 conditions, 6941 events. 4274/6941 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 43720 event pairs, 22 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:30:16,405 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:16,423 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-10-12 17:30:16,424 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:16,424 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:30:16,424 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 1420 transitions, 24004 flow [2023-10-12 17:30:16,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:16,729 INFO L124 PetriNetUnfolderBase]: 1388/2180 cut-off events. [2023-10-12 17:30:16,729 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2023-10-12 17:30:16,729 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:16,730 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 382#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 131#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 131#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 258#[L52-1, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 258#[L52-1, L32-1, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:16,730 INFO L750 eck$LassoCheckResult]: Loop: 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:16,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1311303341, now seen corresponding path program 3 times [2023-10-12 17:30:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714219559] [2023-10-12 17:30:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:16,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:16,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:16,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 3 times [2023-10-12 17:30:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513308339] [2023-10-12 17:30:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:16,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:16,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:16,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1737087789, now seen corresponding path program 4 times [2023-10-12 17:30:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765356549] [2023-10-12 17:30:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:16,786 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:30:16,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765356549] [2023-10-12 17:30:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765356549] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954391023] [2023-10-12 17:30:16,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:30:16,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:16,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:16,923 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:30:16,925 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:30:16,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:30:16,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:16,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:30:16,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:16,997 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:30:16,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:17,027 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:30:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954391023] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:17,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:30:17,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235711402] [2023-10-12 17:30:17,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:30:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:30:17,121 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:30:17,121 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:19,209 INFO L124 PetriNetUnfolderBase]: 7033/11522 cut-off events. [2023-10-12 17:30:19,209 INFO L125 PetriNetUnfolderBase]: For 3814/3814 co-relation queries the response was YES. [2023-10-12 17:30:19,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 11522 events. 7033/11522 cut-off events. For 3814/3814 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 79678 event pairs, 20 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:30:19,301 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 1733 selfloop transitions, 328 changer transitions 437/2498 dead transitions. [2023-10-12 17:30:19,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:19,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:22,295 INFO L124 PetriNetUnfolderBase]: 7033/11522 cut-off events. [2023-10-12 17:30:22,295 INFO L125 PetriNetUnfolderBase]: For 3814/3814 co-relation queries the response was YES. [2023-10-12 17:30:22,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 11522 events. 7033/11522 cut-off events. For 3814/3814 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 79649 event pairs, 20 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:30:22,315 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:22,353 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:30:22,359 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:22,359 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:30:22,359 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 places, 2498 transitions, 47175 flow [2023-10-12 17:30:23,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:23,229 INFO L124 PetriNetUnfolderBase]: 2318/3643 cut-off events. [2023-10-12 17:30:23,229 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2023-10-12 17:30:23,229 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:23,230 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 59#[L32-1, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 112#[$Ultimate##0, L90, L32-1]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 492#[$Ultimate##0, L90, thread1EXIT]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [2023-10-12 17:30:23,230 INFO L750 eck$LassoCheckResult]: Loop: 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 151#[L90, L52-1, thread1EXIT]true [2023-10-12 17:30:23,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2072937097, now seen corresponding path program 1 times [2023-10-12 17:30:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058932046] [2023-10-12 17:30:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:23,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash 6241, now seen corresponding path program 5 times [2023-10-12 17:30:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762096070] [2023-10-12 17:30:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:23,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 772280407, now seen corresponding path program 2 times [2023-10-12 17:30:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366483559] [2023-10-12 17:30:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:23,380 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:30:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366483559] [2023-10-12 17:30:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366483559] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909732147] [2023-10-12 17:30:23,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:23,399 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:30:23,400 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:30:23,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:23,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:23,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2023-10-12 17:30:23,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:23,510 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:30:23,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:23,548 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:30:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909732147] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:23,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-10-12 17:30:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496632119] [2023-10-12 17:30:23,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-10-12 17:30:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2023-10-12 17:30:23,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 2498 transitions, 47175 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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:30:23,683 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:23,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:28,559 INFO L124 PetriNetUnfolderBase]: 10235/16729 cut-off events. [2023-10-12 17:30:28,560 INFO L125 PetriNetUnfolderBase]: For 5531/5531 co-relation queries the response was YES. [2023-10-12 17:30:28,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170952 conditions, 16729 events. 10235/16729 cut-off events. For 5531/5531 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 120916 event pairs, 25 based on Foata normal form. 0/11205 useless extension candidates. Maximal degree in co-relation 149987. Up to 16612 conditions per place. [2023-10-12 17:30:28,675 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 2310 selfloop transitions, 720 changer transitions 649/3679 dead transitions. [2023-10-12 17:30:28,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:28,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:36,366 INFO L124 PetriNetUnfolderBase]: 10235/16729 cut-off events. [2023-10-12 17:30:36,366 INFO L125 PetriNetUnfolderBase]: For 5531/5531 co-relation queries the response was YES. [2023-10-12 17:30:36,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170952 conditions, 16729 events. 10235/16729 cut-off events. For 5531/5531 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 120884 event pairs, 25 based on Foata normal form. 0/11205 useless extension candidates. Maximal degree in co-relation 149987. Up to 16612 conditions per place. [2023-10-12 17:30:36,385 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:36,452 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-10-12 17:30:36,453 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:36,453 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:30:36,453 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 3679 transitions, 76787 flow [2023-10-12 17:30:38,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:38,422 INFO L124 PetriNetUnfolderBase]: 2828/4474 cut-off events. [2023-10-12 17:30:38,422 INFO L125 PetriNetUnfolderBase]: For 1443/1443 co-relation queries the response was YES. [2023-10-12 17:30:38,422 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:38,423 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 110#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 382#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 605#[$Ultimate##0, L73-1, $Ultimate##0, L91]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 607#[L73-1, $Ultimate##0, L52-1, L91]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 261#[L73-1, L52-1, L32-1, L91]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 261#[L73-1, L52-1, L32-1, L91]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 261#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:38,423 INFO L750 eck$LassoCheckResult]: Loop: 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 261#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:30:38,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash 101280383, now seen corresponding path program 5 times [2023-10-12 17:30:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650045998] [2023-10-12 17:30:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:38,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 4 times [2023-10-12 17:30:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629345161] [2023-10-12 17:30:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:38,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1453794561, now seen corresponding path program 6 times [2023-10-12 17:30:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593654403] [2023-10-12 17:30:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:38,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:39,166 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:39,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:39,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:39,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:39,167 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:39,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:39,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:39,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:39,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:30:39,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:39,167 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:39,169 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:30:39,171 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:30:39,173 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:30:39,176 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:30:39,178 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:30:39,180 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:30:39,182 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:30:39,366 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:30:39,375 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:30:39,377 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:30:39,379 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:30:39,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:39,916 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:39,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:30:39,929 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:30:39,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:39,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:39,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:39,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:39,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:39,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:39,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:39,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:39,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:39,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:39,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:30:39,963 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:30:39,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:39,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:39,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:39,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:39,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:39,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:39,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:40,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:30:40,007 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:30:40,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,030 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:30:40,033 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:30:40,034 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:30:40,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:30:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,062 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:30:40,064 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:30:40,066 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:30:40,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:40,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,085 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:30:40,094 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:30:40,095 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:30:40,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,113 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:30:40,115 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:30:40,117 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:30:40,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,124 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:30:40,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,262 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:30:40,262 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:30:40,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,527 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:30:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,530 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:30:40,547 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:30:40,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,560 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:30:40,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:40,575 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:30:40,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,585 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:30:40,613 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:30:40,614 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:30:40,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:40,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:40,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:40,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:40,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:40,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:40,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:40,652 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:30:40,652 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:30:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:40,655 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:30:40,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:40,670 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:30:40,689 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:40,689 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:40,689 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:30:40,706 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:30:40,722 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2023-10-12 17:30:40,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:40,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:40,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:40,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:40,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:40,782 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:30:40,782 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:30:40,782 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:30:40,879 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 447 transitions. [2023-10-12 17:30:40,879 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:41,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:30:41,607 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:41,608 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:30:41,609 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:30:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2023-10-12 17:30:41,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:30:41,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:41,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 16 letters. Loop has 2 letters. [2023-10-12 17:30:41,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:41,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 14 letters. Loop has 4 letters. [2023-10-12 17:30:41,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 49014 transitions, 1123206 flow Received shutdown request... [2023-10-12 17:34:53,073 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:34:53,073 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:53,074 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:53,074 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:34:53,112 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:34:53,112 INFO L430 stractBuchiCegarLoop]: Abstraction has has 72 places, 49014 transitions, 1123206 flow [2023-10-12 17:34:53,113 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:34:53,113 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 72 places, 49014 transitions, 1123206 flow [2023-10-12 17:34:53,120 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:34:53,147 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:34:53,178 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:34:53 BoogieIcfgContainer [2023-10-12 17:34:53,178 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:34:53,179 INFO L158 Benchmark]: Toolchain (without parser) took 284615.37ms. Allocated memory was 196.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 143.1MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-10-12 17:34:53,179 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 196.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:34:53,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.25ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 141.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:34:53,180 INFO L158 Benchmark]: Boogie Preprocessor took 13.35ms. Allocated memory is still 196.1MB. Free memory was 141.4MB in the beginning and 140.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:34:53,180 INFO L158 Benchmark]: RCFGBuilder took 300.49ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 140.2MB in the beginning and 205.6MB in the end (delta: -65.4MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2023-10-12 17:34:53,181 INFO L158 Benchmark]: BuchiAutomizer took 284270.07ms. Allocated memory was 235.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 205.1MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-10-12 17:34:53,183 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.29ms. Allocated memory is still 196.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.25ms. Allocated memory is still 196.1MB. Free memory was 142.9MB in the beginning and 141.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.35ms. Allocated memory is still 196.1MB. Free memory was 141.4MB in the beginning and 140.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 300.49ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 140.2MB in the beginning and 205.6MB in the end (delta: -65.4MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 284270.07ms. Allocated memory was 235.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 205.1MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.7GB. 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 9 locations. The remainder module has 1123206 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 284.1s and 11 iterations. TraceHistogramMax:0. Analysis of lassos took 5.0s. Construction of modules took 0.4s. Büchi inclusion checks took 22.7s. 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, 596 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 142 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf100 lsp52 ukn96 mio100 lsp84 div100 bol103 ite100 ukn100 eq184 hnf90 smp100 dnf231 smp79 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 390ms VariablesStem: 21 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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, 46 PlacesBefore, 25 PlacesAfterwards, 39 TransitionsBefore, 18 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 22 TotalNumberOfCompositions, 535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, independent: 497, independent conditional: 0, independent unconditional: 497, 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: 395, independent: 389, independent conditional: 0, independent unconditional: 389, 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: 395, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 395, unknown conditional: 0, unknown unconditional: 395] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, 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