/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/horseshoe.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:45,561 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:45,604 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:45,622 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:45,623 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:45,623 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:45,624 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:45,624 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:45,625 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:45,625 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:45,626 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:45,626 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:45,626 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:45,627 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:45,627 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:45,627 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:45,628 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:45,628 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:45,628 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:45,629 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:45,629 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:45,629 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:45,629 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:45,630 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:45,630 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:45,630 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:45,631 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:45,631 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:45,631 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:45,631 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:45,632 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:45,632 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:45,632 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:45,633 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:45,633 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:45,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:45,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:45,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:45,837 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:45,838 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:45,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl [2023-10-12 17:30:45,839 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl' [2023-10-12 17:30:45,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:45,864 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:45,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:45,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:45,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:45,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,894 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:45,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:45,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:45,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:45,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:45,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:45,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:45,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:45,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/1) ... [2023-10-12 17:30:45,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:45,954 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:45,965 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:45,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:45,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:45,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:45,999 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:45,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:45,999 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:30:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:30:46,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:30:46,000 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:46,047 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:46,049 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:46,155 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:46,176 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:46,177 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:46,179 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:46 BoogieIcfgContainer [2023-10-12 17:30:46,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:46,180 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:46,180 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:46,183 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:46,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:46,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:45" (1/2) ... [2023-10-12 17:30:46,186 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f224547 and model type horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:46, skipping insertion in model container [2023-10-12 17:30:46,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:46,186 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:46" (2/2) ... [2023-10-12 17:30:46,187 INFO L332 chiAutomizerObserver]: Analyzing ICFG horseshoe.wvr.bpl [2023-10-12 17:30:46,241 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:30:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:30:46,288 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:30:46,288 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:30:46,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:30:46,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-10-12 17:30:46,305 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:46,319 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:30:46,322 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:30:46,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2023-10-12 17:30:46,331 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:30:46,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:46,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:30:46,338 INFO L119 LiptonReduction]: Number of co-enabled transitions 316 [2023-10-12 17:30:46,937 INFO L134 LiptonReduction]: Checked pairs total: 277 [2023-10-12 17:30:46,937 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-10-12 17:30:46,951 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:46,951 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:46,951 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:46,951 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:46,951 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:46,952 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:46,952 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:46,952 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:46,952 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:46,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:46,956 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:46,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:46,956 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:46,962 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:46,963 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:46,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:46,964 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:46,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:46,964 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:46,969 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [2023-10-12 17:30:46,969 INFO L750 eck$LassoCheckResult]: Loop: 48#[L77-1, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 48#[L77-1, L28]true [2023-10-12 17:30:46,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash 3576, now seen corresponding path program 1 times [2023-10-12 17:30:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464294340] [2023-10-12 17:30:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:47,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash 157, now seen corresponding path program 1 times [2023-10-12 17:30:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:47,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221136016] [2023-10-12 17:30:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:47,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 110982, now seen corresponding path program 1 times [2023-10-12 17:30:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:47,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746680984] [2023-10-12 17:30:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:47,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:47,278 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:47,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:47,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:47,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:47,279 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:47,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:47,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:47,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:47,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:47,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:47,294 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:47,302 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:47,314 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:47,318 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:47,321 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:47,324 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:47,327 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:47,330 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:47,418 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:47,421 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,433 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:47,446 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:47,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,478 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:47,483 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:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,485 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:47,488 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:47,491 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:47,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:30:47,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:30:47,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:30:47,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,523 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:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:30:47,528 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:47,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:47,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:47,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:30:47,569 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:47,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:47,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:30:47,612 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:47,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:47,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:47,645 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:47,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:30:47,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:47,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,689 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:47,697 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:47,698 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:47,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,725 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:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,727 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:47,729 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:47,733 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:47,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:47,761 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:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,762 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:47,765 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:47,769 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:47,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:47,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:47,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:47,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:47,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:47,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:47,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:47,802 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:30:47,803 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:30:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:47,812 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:47,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:47,837 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:47,847 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:47,847 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:47,848 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:30:47,856 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:47,859 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:30:47,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:47,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:47,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:47,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:47,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:47,921 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:47,961 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:47,963 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:48,099 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 304 transitions. [2023-10-12 17:30:48,100 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:48,102 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:48,105 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:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:30:48,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:30:48,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:48,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:48,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:48,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:30:48,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:48,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:48,147 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:30:48,148 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-10-12 17:30:48,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 573 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:30:48,149 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:48,152 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:48,152 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:48,152 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:48,153 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:48,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:48,161 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:30:48,161 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:30:48,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:48,162 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [2023-10-12 17:30:48,162 INFO L750 eck$LassoCheckResult]: Loop: 93#[L78, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 93#[L78, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 93#[L78, L44, L28]true [2023-10-12 17:30:48,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash 110963, now seen corresponding path program 1 times [2023-10-12 17:30:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116816617] [2023-10-12 17:30:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:48,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 5089, now seen corresponding path program 1 times [2023-10-12 17:30:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487372628] [2023-10-12 17:30:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:48,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 106639571, now seen corresponding path program 1 times [2023-10-12 17:30:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210473649] [2023-10-12 17:30:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:48,295 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:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210473649] [2023-10-12 17:30:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210473649] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:48,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:30:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947073793] [2023-10-12 17:30:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:48,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:48,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 172 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:48,547 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:48,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:48,644 INFO L124 PetriNetUnfolderBase]: 165/252 cut-off events. [2023-10-12 17:30:48,644 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-10-12 17:30:48,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 252 events. 165/252 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 692 event pairs, 14 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 640. Up to 225 conditions per place. [2023-10-12 17:30:48,653 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 55 selfloop transitions, 6 changer transitions 10/71 dead transitions. [2023-10-12 17:30:48,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,677 INFO L124 PetriNetUnfolderBase]: 165/252 cut-off events. [2023-10-12 17:30:48,678 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-10-12 17:30:48,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 252 events. 165/252 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 699 event pairs, 14 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 640. Up to 225 conditions per place. [2023-10-12 17:30:48,678 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,680 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:48,681 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,682 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:48,682 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 71 transitions, 498 flow [2023-10-12 17:30:48,690 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:48,690 INFO L124 PetriNetUnfolderBase]: 33/53 cut-off events. [2023-10-12 17:30:48,690 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:30:48,691 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:48,691 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [2023-10-12 17:30:48,691 INFO L750 eck$LassoCheckResult]: Loop: 93#[L78, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 93#[L78, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 93#[L78, L44, L28]true [2023-10-12 17:30:48,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 3440549, now seen corresponding path program 1 times [2023-10-12 17:30:48,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131216832] [2023-10-12 17:30:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:48,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 5089, now seen corresponding path program 2 times [2023-10-12 17:30:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120964258] [2023-10-12 17:30:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:48,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:48,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -988595579, now seen corresponding path program 1 times [2023-10-12 17:30:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327387237] [2023-10-12 17:30:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:48,820 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:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:48,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327387237] [2023-10-12 17:30:48,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327387237] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:48,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:48,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:30:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811621980] [2023-10-12 17:30:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:48,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:30:48,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:30:48,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 71 transitions, 498 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:48,969 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:48,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:49,068 INFO L124 PetriNetUnfolderBase]: 358/573 cut-off events. [2023-10-12 17:30:49,069 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-10-12 17:30:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 573 events. 358/573 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2228 event pairs, 11 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1774. Up to 546 conditions per place. [2023-10-12 17:30:49,075 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 104 selfloop transitions, 19 changer transitions 24/147 dead transitions. [2023-10-12 17:30:49,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,118 INFO L124 PetriNetUnfolderBase]: 358/573 cut-off events. [2023-10-12 17:30:49,118 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-10-12 17:30:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 573 events. 358/573 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2221 event pairs, 11 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1774. Up to 546 conditions per place. [2023-10-12 17:30:49,120 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,122 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:30:49,123 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,123 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:49,123 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 147 transitions, 1338 flow [2023-10-12 17:30:49,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:49,132 INFO L124 PetriNetUnfolderBase]: 49/86 cut-off events. [2023-10-12 17:30:49,132 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:30:49,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:49,133 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 93#[L78, L44, L28]true [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 129#[L44, L78, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 129#[L44, L78, thread1EXIT]true [2023-10-12 17:30:49,133 INFO L750 eck$LassoCheckResult]: Loop: 129#[L44, L78, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 129#[L44, L78, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 129#[L44, L78, thread1EXIT]true [2023-10-12 17:30:49,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -989143380, now seen corresponding path program 1 times [2023-10-12 17:30:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286129381] [2023-10-12 17:30:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:49,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 5089, now seen corresponding path program 3 times [2023-10-12 17:30:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316972298] [2023-10-12 17:30:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:49,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1379011636, now seen corresponding path program 2 times [2023-10-12 17:30:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416553787] [2023-10-12 17:30:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416553787] [2023-10-12 17:30:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416553787] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277105774] [2023-10-12 17:30:49,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:49,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:49,228 INFO L229 MonitoredProcess]: Starting monitored process 12 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:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-10-12 17:30:49,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:49,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:49,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:30:49,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:49,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277105774] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:49,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:30:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353357796] [2023-10-12 17:30:49,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:30:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:30:49,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 147 transitions, 1338 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:49,506 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:49,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:49,687 INFO L124 PetriNetUnfolderBase]: 677/1086 cut-off events. [2023-10-12 17:30:49,688 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-10-12 17:30:49,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5774 conditions, 1086 events. 677/1086 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4900 event pairs, 13 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 4068. Up to 1059 conditions per place. [2023-10-12 17:30:49,698 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 180 selfloop transitions, 42 changer transitions 45/267 dead transitions. [2023-10-12 17:30:49,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,787 INFO L124 PetriNetUnfolderBase]: 677/1086 cut-off events. [2023-10-12 17:30:49,787 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-10-12 17:30:49,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5774 conditions, 1086 events. 677/1086 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4896 event pairs, 13 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 4068. Up to 1059 conditions per place. [2023-10-12 17:30:49,789 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,794 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:30:49,796 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,796 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:30:49,796 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 places, 267 transitions, 2964 flow [2023-10-12 17:30:49,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:49,810 INFO L124 PetriNetUnfolderBase]: 61/106 cut-off events. [2023-10-12 17:30:49,810 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-10-12 17:30:49,810 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:49,811 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 93#[L78, L44, L28]true [110] L78-->L62: 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] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:30:49,811 INFO L750 eck$LassoCheckResult]: Loop: 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:30:49,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash -989143940, now seen corresponding path program 1 times [2023-10-12 17:30:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233964698] [2023-10-12 17:30:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:49,851 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:49,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233964698] [2023-10-12 17:30:49,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233964698] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:49,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:30:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476613417] [2023-10-12 17:30:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:49,852 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:30:49,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 5025, now seen corresponding path program 1 times [2023-10-12 17:30:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375373893] [2023-10-12 17:30:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:49,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:49,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 267 transitions, 2964 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:49,970 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:49,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:50,155 INFO L124 PetriNetUnfolderBase]: 934/1514 cut-off events. [2023-10-12 17:30:50,156 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2023-10-12 17:30:50,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9559 conditions, 1514 events. 934/1514 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7514 event pairs, 3 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 7350. Up to 1497 conditions per place. [2023-10-12 17:30:50,167 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 298 selfloop transitions, 16 changer transitions 65/379 dead transitions. [2023-10-12 17:30:50,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,314 INFO L124 PetriNetUnfolderBase]: 934/1514 cut-off events. [2023-10-12 17:30:50,314 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2023-10-12 17:30:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9559 conditions, 1514 events. 934/1514 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7505 event pairs, 3 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 7350. Up to 1497 conditions per place. [2023-10-12 17:30:50,316 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,323 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:50,326 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,326 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:50,326 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 379 transitions, 4965 flow [2023-10-12 17:30:50,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:50,351 INFO L124 PetriNetUnfolderBase]: 118/200 cut-off events. [2023-10-12 17:30:50,351 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-10-12 17:30:50,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:50,352 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 93#[L78, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 93#[L78, L44, L28]true [110] L78-->L62: 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] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:30:50,352 INFO L750 eck$LassoCheckResult]: Loop: 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:30:50,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -598673209, now seen corresponding path program 1 times [2023-10-12 17:30:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196629666] [2023-10-12 17:30:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:50,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:50,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:50,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash 5025, now seen corresponding path program 2 times [2023-10-12 17:30:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374556941] [2023-10-12 17:30:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:50,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:50,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:50,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash 200667879, now seen corresponding path program 2 times [2023-10-12 17:30:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:50,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459055187] [2023-10-12 17:30:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:50,469 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:50,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459055187] [2023-10-12 17:30:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459055187] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:50,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:30:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328438124] [2023-10-12 17:30:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:30:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:30:50,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 379 transitions, 4965 flow. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:50,582 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:50,982 INFO L124 PetriNetUnfolderBase]: 1843/3080 cut-off events. [2023-10-12 17:30:50,982 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2023-10-12 17:30:50,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22402 conditions, 3080 events. 1843/3080 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 18129 event pairs, 3 based on Foata normal form. 0/2030 useless extension candidates. Maximal degree in co-relation 18313. Up to 3063 conditions per place. [2023-10-12 17:30:51,015 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 559 selfloop transitions, 82 changer transitions 145/786 dead transitions. [2023-10-12 17:30:51,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,470 INFO L124 PetriNetUnfolderBase]: 1843/3080 cut-off events. [2023-10-12 17:30:51,470 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2023-10-12 17:30:51,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22402 conditions, 3080 events. 1843/3080 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 18163 event pairs, 3 based on Foata normal form. 0/2030 useless extension candidates. Maximal degree in co-relation 18313. Up to 3063 conditions per place. [2023-10-12 17:30:51,476 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,493 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:30:51,494 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,494 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:30:51,495 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 786 transitions, 11808 flow [2023-10-12 17:30:51,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:51,618 INFO L124 PetriNetUnfolderBase]: 469/764 cut-off events. [2023-10-12 17:30:51,618 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-10-12 17:30:51,618 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:51,619 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 93#[L78, L44, L28]true [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 129#[L44, L78, thread1EXIT]true [110] L78-->L62: 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] 232#[L62, L79, L44, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 232#[L62, L79, L44, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 232#[L62, L79, L44, thread1EXIT]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 232#[L62, L79, L44, thread1EXIT]true [2023-10-12 17:30:51,619 INFO L750 eck$LassoCheckResult]: Loop: 232#[L62, L79, L44, thread1EXIT]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 232#[L62, L79, L44, thread1EXIT]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 232#[L62, L79, L44, thread1EXIT]true [2023-10-12 17:30:51,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash 199746342, now seen corresponding path program 1 times [2023-10-12 17:30:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857268940] [2023-10-12 17:30:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:51,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:51,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:51,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 5025, now seen corresponding path program 3 times [2023-10-12 17:30:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:51,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988691000] [2023-10-12 17:30:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:51,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:51,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:51,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1317289594, now seen corresponding path program 2 times [2023-10-12 17:30:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762978550] [2023-10-12 17:30:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:51,704 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:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762978550] [2023-10-12 17:30:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762978550] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847869100] [2023-10-12 17:30:51,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:51,706 INFO L229 MonitoredProcess]: Starting monitored process 13 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:51,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-10-12 17:30:51,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:51,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:51,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:30:51,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:51,780 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:51,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:51,818 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:51,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847869100] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:51,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:30:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738026651] [2023-10-12 17:30:51,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:30:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:30:51,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 786 transitions, 11808 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:51,929 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:51,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:52,903 INFO L124 PetriNetUnfolderBase]: 3258/5470 cut-off events. [2023-10-12 17:30:52,904 INFO L125 PetriNetUnfolderBase]: For 1927/1927 co-relation queries the response was YES. [2023-10-12 17:30:52,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45127 conditions, 5470 events. 3258/5470 cut-off events. For 1927/1927 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 35668 event pairs, 3 based on Foata normal form. 0/3598 useless extension candidates. Maximal degree in co-relation 37800. Up to 5453 conditions per place. [2023-10-12 17:30:52,950 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 945 selfloop transitions, 194 changer transitions 265/1404 dead transitions. [2023-10-12 17:30:52,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:52,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:53,960 INFO L124 PetriNetUnfolderBase]: 3258/5470 cut-off events. [2023-10-12 17:30:53,960 INFO L125 PetriNetUnfolderBase]: For 1927/1927 co-relation queries the response was YES. [2023-10-12 17:30:53,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45127 conditions, 5470 events. 3258/5470 cut-off events. For 1927/1927 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 35657 event pairs, 3 based on Foata normal form. 0/3598 useless extension candidates. Maximal degree in co-relation 37800. Up to 5453 conditions per place. [2023-10-12 17:30:53,965 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:54,034 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:30:54,036 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:54,037 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:30:54,037 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 1404 transitions, 23832 flow [2023-10-12 17:30:54,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:54,240 INFO L124 PetriNetUnfolderBase]: 654/1082 cut-off events. [2023-10-12 17:30:54,241 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-10-12 17:30:54,241 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:54,241 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [110] L78-->L62: 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] 193#[L62, L79, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 193#[L62, L79, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 193#[L62, L79, L44, L28]true [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 232#[L62, L79, L44, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 232#[L62, L79, L44, thread1EXIT]true [2023-10-12 17:30:54,241 INFO L750 eck$LassoCheckResult]: Loop: 232#[L62, L79, L44, thread1EXIT]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 232#[L62, L79, L44, thread1EXIT]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 232#[L62, L79, L44, thread1EXIT]true [2023-10-12 17:30:54,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1393850468, now seen corresponding path program 1 times [2023-10-12 17:30:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375233996] [2023-10-12 17:30:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:54,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 5027, now seen corresponding path program 1 times [2023-10-12 17:30:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208068212] [2023-10-12 17:30:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:54,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash 539500670, now seen corresponding path program 3 times [2023-10-12 17:30:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:54,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474773875] [2023-10-12 17:30:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:54,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:54,756 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:54,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:54,756 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:54,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:54,756 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:54,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:54,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:54,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:54,757 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:30:54,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:54,757 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:54,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:54,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:54,770 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:54,775 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:54,777 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:54,780 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:54,783 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:54,785 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:54,975 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:55,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:55,536 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,579 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:55,580 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:55,582 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:55,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,617 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:55,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,620 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:55,631 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:55,631 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:55,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,649 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:55,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,650 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:55,653 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:55,655 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:55,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,687 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:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,688 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:55,691 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:55,692 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:55,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,712 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:55,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:30:55,717 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:55,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:55,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,732 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:30:55,735 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:55,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,757 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:55,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:30:55,763 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:55,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:55,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:55,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:55,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:55,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:55,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:55,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:55,781 INFO L229 MonitoredProcess]: Starting monitored process 21 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:55,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:30:55,784 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:55,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:55,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:55,791 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:30:55,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:55,881 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:30:55,881 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:30:56,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:56,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:56,028 INFO L229 MonitoredProcess]: Starting monitored process 22 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:56,040 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:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:30:56,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:56,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:56,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:56,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:56,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:56,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:56,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:56,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:56,074 INFO L229 MonitoredProcess]: Starting monitored process 23 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:56,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:30:56,079 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:56,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:56,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:56,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:56,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:56,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:56,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:56,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:56,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:56,124 INFO L229 MonitoredProcess]: Starting monitored process 24 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:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:30:56,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:30:56,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:56,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:56,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:56,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:56,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:56,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:56,154 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:56,165 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:30:56,165 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:56,168 INFO L229 MonitoredProcess]: Starting monitored process 25 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:56,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:30:56,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:56,194 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:56,194 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:56,194 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:30:56,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:56,211 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:30:56,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:56,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:56,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:56,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:56,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:56,263 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:56,263 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:56,263 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56,360 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 340 transitions. [2023-10-12 17:30:56,360 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:56,560 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:56,560 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:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:30:56,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:30:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:30:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:30:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 18140 transitions, 345672 flow [2023-10-12 17:30:57,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:31,304 INFO L124 PetriNetUnfolderBase]: 5658/9778 cut-off events. [2023-10-12 17:31:31,304 INFO L125 PetriNetUnfolderBase]: For 3878/3878 co-relation queries the response was YES. [2023-10-12 17:31:31,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90453 conditions, 9778 events. 5658/9778 cut-off events. For 3878/3878 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 73556 event pairs, 20 based on Foata normal form. 0/6559 useless extension candidates. Maximal degree in co-relation 73722. Up to 9761 conditions per place. [2023-10-12 17:31:31,312 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 58 places, 18140 transitions, 345672 flow [2023-10-12 17:31:31,638 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 58 places, 18140 transitions, 345672 flow [2023-10-12 17:31:31,638 INFO L430 stractBuchiCegarLoop]: Abstraction has has 58 places, 18140 transitions, 345672 flow [2023-10-12 17:31:31,639 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:31:31,639 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 58 places, 18140 transitions, 345672 flow [2023-10-12 17:31:42,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:42,910 INFO L124 PetriNetUnfolderBase]: 2011/3292 cut-off events. [2023-10-12 17:31:42,910 INFO L125 PetriNetUnfolderBase]: For 1258/1258 co-relation queries the response was YES. [2023-10-12 17:31:42,910 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:42,911 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]true [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L77-1, L28]true [107] L77-1-->L44: 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] 93#[L78, L44, L28]true [110] L78-->L62: 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] 193#[L62, L79, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 193#[L62, L79, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 193#[L62, L79, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 193#[L62, L79, L44, L28]true [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 193#[L62, L79, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 193#[L62, L79, L44, L28]true [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:31:42,911 INFO L750 eck$LassoCheckResult]: Loop: 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 193#[L62, L79, L44, L28]true [2023-10-12 17:31:42,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash -454512217, now seen corresponding path program 3 times [2023-10-12 17:31:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292876167] [2023-10-12 17:31:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:42,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 5025, now seen corresponding path program 4 times [2023-10-12 17:31:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688755279] [2023-10-12 17:31:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:42,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1300427719, now seen corresponding path program 4 times [2023-10-12 17:31:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919761580] [2023-10-12 17:31:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:42,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:43,592 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:43,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:43,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:43,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:43,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:43,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:43,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:43,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:43,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:31:43,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:43,593 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:43,600 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,602 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,605 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,607 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,897 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,899 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:43,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:44,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:44,359 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:31:44,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,394 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:31:44,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-10-12 17:31:44,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,412 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:31:44,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:31:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,431 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:31:44,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-10-12 17:31:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,451 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:31:44,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,462 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:31:44,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,491 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:31:44,491 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:31:44,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:44,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,555 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:44,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:31:44,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:44,610 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:31:44,611 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:31:44,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,613 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:44,633 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:44,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:31:44,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:44,658 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:44,658 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:31:44,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-10-12 17:31:44,680 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-10-12 17:31:44,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:44,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:44,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:44,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:31:44,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:44,749 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:31:44,749 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:44,827 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 346 transitions. [2023-10-12 17:31:44,827 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:45,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:47,599 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:31:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2023-10-12 17:31:47,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 202 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:31:47,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:47,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 202 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:31:47,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:47,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 202 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:31:47,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:47,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 242736 transitions, 5122848 flow Received shutdown request... [2023-10-12 17:34:47,663 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:47,663 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:47,663 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:47,673 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:47,673 INFO L430 stractBuchiCegarLoop]: Abstraction has has 70 places, 242736 transitions, 5122848 flow [2023-10-12 17:34:47,673 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:34:47,673 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 242736 transitions, 5122848 flow [2023-10-12 17:34:47,947 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:34:47,952 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:34:47 BoogieIcfgContainer [2023-10-12 17:34:47,952 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:34:47,952 INFO L158 Benchmark]: Toolchain (without parser) took 242088.43ms. Allocated memory was 176.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 129.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-10-12 17:34:47,953 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 176.2MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:34:47,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.01ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 128.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:34:47,953 INFO L158 Benchmark]: Boogie Preprocessor took 27.63ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 127.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:34:47,953 INFO L158 Benchmark]: RCFGBuilder took 254.32ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 115.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:34:47,954 INFO L158 Benchmark]: BuchiAutomizer took 241771.99ms. Allocated memory was 176.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 115.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-10-12 17:34:47,955 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.24ms. Allocated memory is still 176.2MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.01ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 128.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.63ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 127.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.32ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 115.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 241771.99ms. Allocated memory was 176.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 115.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 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 -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 5122848 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 241.6s and 10 iterations. TraceHistogramMax:0. Analysis of lassos took 6.3s. Construction of modules took 0.3s. Büchi inclusion checks took 7.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 144 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital132 mio100 ax100 hnf100 lsp71 ukn92 mio100 lsp79 div100 bol109 ite100 ukn100 eq177 hnf90 smp100 dnf320 smp67 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 238ms VariablesStem: 13 VariablesLoop: 13 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - 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.6s, 37 PlacesBefore, 22 PlacesAfterwards, 30 TransitionsBefore, 15 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 277 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 258, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 203, unknown conditional: 0, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, 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