/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:49,459 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:49,528 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:38:49,560 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:49,560 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:49,561 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:49,563 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:49,563 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:49,564 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:49,567 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:49,568 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:49,568 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:49,568 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:49,569 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:49,569 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:49,570 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:49,570 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:49,570 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:49,570 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:49,571 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:49,571 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:49,571 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:49,572 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:49,573 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:49,573 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:49,573 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:49,573 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:49,573 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:49,574 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:49,574 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:49,575 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:49,575 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:49,575 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:49,576 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:49,577 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:38:49,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:49,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:49,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:49,841 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:49,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:49,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl [2023-10-12 17:38:49,844 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl' [2023-10-12 17:38:49,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:49,883 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:49,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:49,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:49,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:49,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,912 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:49,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:49,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:49,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:49,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:49,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:49,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:49,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:49,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:49,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/1) ... [2023-10-12 17:38:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:49,969 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:38:49,973 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:38:50,002 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:50,005 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:50,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:50,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:50,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:50,011 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:38:50,061 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:50,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:50,189 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:50,233 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:50,233 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:50,235 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:50 BoogieIcfgContainer [2023-10-12 17:38:50,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:50,236 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:50,236 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:50,243 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:50,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:50,244 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:49" (1/2) ... [2023-10-12 17:38:50,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed497ea and model type ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:50, skipping insertion in model container [2023-10-12 17:38:50,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:50,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:50" (2/2) ... [2023-10-12 17:38:50,250 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring-nondet.wvr.bpl [2023-10-12 17:38:50,314 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:50,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:38:50,357 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:38:50,358 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:50,362 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 54 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:38:50,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:38:50,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-10-12 17:38:50,368 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:50,380 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:38:50,383 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:38:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2023-10-12 17:38:50,391 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:38:50,391 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:50,392 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 54 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:38:50,393 INFO L119 LiptonReduction]: Number of co-enabled transitions 314 [2023-10-12 17:38:51,095 INFO L134 LiptonReduction]: Checked pairs total: 304 [2023-10-12 17:38:51,096 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-10-12 17:38:51,108 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:51,108 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:51,109 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:51,109 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:51,109 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:51,109 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:51,109 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:51,110 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:51,110 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:38:51,114 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][5], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][10]] [2023-10-12 17:38:51,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:51,122 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:51,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:51,123 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:51,127 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:51,127 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:38:51,130 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][5], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][10]] [2023-10-12 17:38:51,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:51,130 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:51,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:51,131 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:51,135 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [2023-10-12 17:38:51,136 INFO L750 eck$LassoCheckResult]: Loop: 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [2023-10-12 17:38:51,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 4057, now seen corresponding path program 1 times [2023-10-12 17:38:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465265902] [2023-10-12 17:38:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:51,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 1 times [2023-10-12 17:38:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905529689] [2023-10-12 17:38:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:51,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash 125899, now seen corresponding path program 1 times [2023-10-12 17:38:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817437214] [2023-10-12 17:38:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:51,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:51,557 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:51,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:51,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:51,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:51,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:51,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:51,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:51,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:51,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:51,558 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:51,578 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:38:51,587 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:38:51,590 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:38:51,593 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:38:51,596 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:38:51,599 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:38:51,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:38:51,887 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:38:52,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:52,062 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,067 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:38:52,074 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:38:52,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,094 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:38:52,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:38:52,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,103 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:38:52,105 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:38:52,107 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:38:52,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,165 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:38:52,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,167 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:38:52,179 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:38:52,181 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:38:52,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,207 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:38:52,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,209 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:38:52,217 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:38:52,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,249 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:38:52,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,267 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:38:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,270 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:38:52,273 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:38:52,276 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:38:52,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,307 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:38:52,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,311 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:38:52,324 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:38:52,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,348 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:38:52,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:38:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,369 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:38:52,373 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:38:52,377 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:38:52,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,385 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:52,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,423 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:52,423 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:52,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:52,503 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:38:52,504 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:38:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,508 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:38:52,509 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:38:52,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:52,581 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-10-12 17:38:52,581 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:52,582 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i, q3_back, q3_front) = 1*N - 1*i + 1*q3_back - 1*q3_front Supporting invariants [1*q3_back - 1*q3_front >= 0] [2023-10-12 17:38:52,589 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:38:52,598 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:38:52,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:52,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:38:52,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:52,673 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:38:52,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:52,674 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:38:52,710 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2023-10-12 17:38:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:38:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) 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:38:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2023-10-12 17:38:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:52,997 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 105 transitions, 546 flow [2023-10-12 17:38:52,997 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:52,998 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 105 transitions, 546 flow [2023-10-12 17:38:52,999 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][36], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][21], 4:3A:[123] L95-1-->L58: 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][48]][5:4A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][101]] [2023-10-12 17:38:53,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:53,000 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:38:53,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:53,000 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:53,000 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [2023-10-12 17:38:53,001 INFO L750 eck$LassoCheckResult]: Loop: 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:53,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,001 INFO L85 PathProgramCache]: Analyzing trace with hash 125890, now seen corresponding path program 1 times [2023-10-12 17:38:53,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171234834] [2023-10-12 17:38:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:38:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737543412] [2023-10-12 17:38:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 3902735, now seen corresponding path program 1 times [2023-10-12 17:38:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984654636] [2023-10-12 17:38:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,100 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:38:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984654636] [2023-10-12 17:38:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984654636] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:53,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:53,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:53,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874405654] [2023-10-12 17:38:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:53,182 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 29 places, 105 transitions, 546 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:53,182 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:53,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:53,231 INFO L124 PetriNetUnfolderBase]: 108/164 cut-off events. [2023-10-12 17:38:53,231 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-10-12 17:38:53,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 164 events. 108/164 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 11 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 400. Up to 147 conditions per place. [2023-10-12 17:38:53,235 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-10-12 17:38:53,235 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 28 places, 46 transitions, 315 flow [2023-10-12 17:38:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:53,237 INFO L430 stractBuchiCegarLoop]: Abstraction has has 28 places, 46 transitions, 315 flow [2023-10-12 17:38:53,237 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:53,237 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 46 transitions, 315 flow [2023-10-12 17:38:53,239 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][2], 9:4A:[123] L95-1-->L58: 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][5]][10:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][14]] [2023-10-12 17:38:53,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:53,240 INFO L124 PetriNetUnfolderBase]: 3/9 cut-off events. [2023-10-12 17:38:53,240 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:53,240 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:53,240 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 112#[L95-1, thread1EXIT]true [123] L95-1-->L58: 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] 114#[L58, L96, thread1EXIT]true [2023-10-12 17:38:53,241 INFO L750 eck$LassoCheckResult]: Loop: 114#[L58, L96, thread1EXIT]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 114#[L58, L96, thread1EXIT]true [2023-10-12 17:38:53,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 3903302, now seen corresponding path program 1 times [2023-10-12 17:38:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041975619] [2023-10-12 17:38:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 2 times [2023-10-12 17:38:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661660334] [2023-10-12 17:38:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,277 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2023-10-12 17:38:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 121002507, now seen corresponding path program 1 times [2023-10-12 17:38:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886349104] [2023-10-12 17:38:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:38:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,500 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:53,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:53,501 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:53,501 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:53,501 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:53,501 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,501 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:53,501 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:53,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:53,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:53,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:53,503 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:38:53,509 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:38:53,562 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:38:53,566 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:38:53,570 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:38:53,574 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:38:53,576 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:38:53,578 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:38:53,580 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:38:53,583 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:38:53,771 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:53,772 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:53,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:53,773 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:38:53,775 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:38:53,777 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:38:53,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:53,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:53,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:53,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:53,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:53,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:53,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:53,808 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:38:53,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:53,810 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:38:53,818 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:38:53,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:53,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:53,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:53,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:53,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:53,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:53,832 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:38:53,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:53,846 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:38:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:53,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:53,855 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:38:53,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:53,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:53,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:53,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:53,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:53,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:53,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:38:53,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:53,890 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:38:53,890 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:38:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:53,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:53,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:53,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:38:53,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:53,934 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:53,934 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:38:53,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:53,938 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:53,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:53,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:53,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:53,971 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:38:53,972 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:38:54,043 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:38:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-10-12 17:38:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:54,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:54,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:54,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,045 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 230 transitions, 2035 flow [2023-10-12 17:38:54,045 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:54,045 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 230 transitions, 2035 flow [2023-10-12 17:38:54,050 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 7:3A:[123] L95-1-->L58: 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][21], 17:4A:[142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][58]][19:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][70]] [2023-10-12 17:38:54,051 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:54,051 INFO L124 PetriNetUnfolderBase]: 8/18 cut-off events. [2023-10-12 17:38:54,051 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:38:54,051 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:54,051 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 114#[L58, L96, thread1EXIT]true [2023-10-12 17:38:54,052 INFO L750 eck$LassoCheckResult]: Loop: 114#[L58, L96, thread1EXIT]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 114#[L58, L96, thread1EXIT]true [2023-10-12 17:38:54,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 3902732, now seen corresponding path program 2 times [2023-10-12 17:38:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481698951] [2023-10-12 17:38:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 3 times [2023-10-12 17:38:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731418964] [2023-10-12 17:38:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash 120984837, now seen corresponding path program 2 times [2023-10-12 17:38:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616220371] [2023-10-12 17:38:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,274 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:54,274 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:54,274 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:54,274 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:54,274 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:54,274 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,274 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:54,274 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:54,274 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:38:54,275 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:54,275 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:54,276 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:38:54,280 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:38:54,282 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:38:54,338 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:38:54,340 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:38:54,342 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:38:54,346 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:38:54,351 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:38:54,358 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:38:54,360 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:38:54,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:54,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:54,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,571 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:38:54,584 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:38:54,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,591 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:38:54,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:38:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,604 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:38:54,606 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:38:54,608 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:38:54,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:38:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,634 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:38:54,644 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:38:54,644 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:38:54,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:54,680 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:54,680 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:38:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,687 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:38:54,688 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:38:54,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:54,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:54,710 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:54,711 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:38:54,716 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:38:54,717 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:54,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:54,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:54,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:54,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:54,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:54,752 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:38:54,753 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:38:54,834 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:38:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-10-12 17:38:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:54,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:54,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:54,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,837 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 1150 transitions, 12475 flow [2023-10-12 17:38:54,837 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:38:54,838 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 38 places, 1150 transitions, 12475 flow [2023-10-12 17:38:54,895 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][6], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][31], 7:3A:[123] L95-1-->L58: 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][106], 13:4A:[126] L96-->L76: 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][241], 44:5A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][496]][46:6A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][821]] [2023-10-12 17:38:54,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:54,896 INFO L124 PetriNetUnfolderBase]: 24/45 cut-off events. [2023-10-12 17:38:54,896 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:38:54,898 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:54,898 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [126] L96-->L76: 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] 189#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 189#[L58, L41, L97, L76]true [2023-10-12 17:38:54,902 INFO L750 eck$LassoCheckResult]: Loop: 189#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 189#[L58, L41, L97, L76]true [2023-10-12 17:38:54,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 120984340, now seen corresponding path program 1 times [2023-10-12 17:38:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435867753] [2023-10-12 17:38:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:38:54,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:54,962 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:38:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435867753] [2023-10-12 17:38:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435867753] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:54,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414791766] [2023-10-12 17:38:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:54,963 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:38:54,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:38:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802623678] [2023-10-12 17:38:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:55,047 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 38 places, 1150 transitions, 12475 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:55,047 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:55,174 INFO L124 PetriNetUnfolderBase]: 288/451 cut-off events. [2023-10-12 17:38:55,175 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-10-12 17:38:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 451 events. 288/451 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1533 event pairs, 16 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 1894. Up to 442 conditions per place. [2023-10-12 17:38:55,182 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 158 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2023-10-12 17:38:55,182 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 37 places, 167 transitions, 2139 flow [2023-10-12 17:38:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:55,184 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 167 transitions, 2139 flow [2023-10-12 17:38:55,184 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:38:55,184 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 167 transitions, 2139 flow [2023-10-12 17:38:55,190 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 7:3A:[123] L95-1-->L58: 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][4], 13:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][10], 42:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][25]][45:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][68]] [2023-10-12 17:38:55,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:55,190 INFO L124 PetriNetUnfolderBase]: 22/44 cut-off events. [2023-10-12 17:38:55,190 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:38:55,190 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:55,191 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:55,191 INFO L750 eck$LassoCheckResult]: Loop: 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:55,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 120984527, now seen corresponding path program 1 times [2023-10-12 17:38:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561943294] [2023-10-12 17:38:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 4 times [2023-10-12 17:38:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515774566] [2023-10-12 17:38:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -544446814, now seen corresponding path program 2 times [2023-10-12 17:38:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290063054] [2023-10-12 17:38:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:55,286 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:38:55,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290063054] [2023-10-12 17:38:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290063054] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:38:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125674718] [2023-10-12 17:38:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:38:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:55,361 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 37 places, 167 transitions, 2139 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:38:55,361 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:55,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:55,513 INFO L124 PetriNetUnfolderBase]: 568/919 cut-off events. [2023-10-12 17:38:55,513 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2023-10-12 17:38:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 919 events. 568/919 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3980 event pairs, 20 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 4409. Up to 910 conditions per place. [2023-10-12 17:38:55,526 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 290 selfloop transitions, 48 changer transitions 0/338 dead transitions. [2023-10-12 17:38:55,526 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 41 places, 338 transitions, 5020 flow [2023-10-12 17:38:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:38:55,527 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 338 transitions, 5020 flow [2023-10-12 17:38:55,527 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:38:55,527 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 41 places, 338 transitions, 5020 flow [2023-10-12 17:38:55,560 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[123] L95-1-->L58: 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][2], 10:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][8], 36:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][21], 126:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][52]][129:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][114]] [2023-10-12 17:38:55,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:55,561 INFO L124 PetriNetUnfolderBase]: 72/128 cut-off events. [2023-10-12 17:38:55,561 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:38:55,561 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:55,562 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:55,562 INFO L750 eck$LassoCheckResult]: Loop: 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:55,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -544447217, now seen corresponding path program 3 times [2023-10-12 17:38:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907729806] [2023-10-12 17:38:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 5 times [2023-10-12 17:38:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126288667] [2023-10-12 17:38:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash 302005602, now seen corresponding path program 4 times [2023-10-12 17:38:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064983072] [2023-10-12 17:38:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:56,067 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:56,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:56,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:56,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:56,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:56,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:56,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:56,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:38:56,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:56,068 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:56,072 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:38:56,075 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:38:56,077 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:38:56,079 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:38:56,084 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:38:56,088 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:38:56,203 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:38:56,206 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:38:56,208 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:38:56,210 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:38:56,215 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:38:56,484 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:56,484 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,489 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:38:56,493 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:38:56,494 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:38:56,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,521 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:38:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,522 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:38:56,524 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:38:56,526 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:38:56,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,552 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:38:56,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,554 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:38:56,560 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:38:56,561 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:38:56,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,591 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:38:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,593 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:38:56,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:56,605 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:38:56,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,633 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:38:56,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,634 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:38:56,635 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:38:56,638 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:38:56,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,679 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:38:56,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,681 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:38:56,685 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:38:56,732 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:38:56,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,739 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:56,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,755 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:56,755 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:56,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:56,785 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:38:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,786 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:38:56,788 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:38:56,791 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:38:56,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:56,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:56,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:56,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:56,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:56,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:56,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:56,823 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:38:56,823 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:38:56,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,825 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:38:56,833 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:56,842 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:38:56,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:56,854 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:56,854 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:38:56,859 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:38:56,861 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:38:56,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:56,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:56,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:56,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:56,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:56,899 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:38:56,900 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:38:56,980 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:38:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-10-12 17:38:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:38:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:38:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:56,982 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 1690 transitions, 28480 flow [2023-10-12 17:38:56,982 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:38:56,982 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 46 places, 1690 transitions, 28480 flow [2023-10-12 17:38:57,101 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][2], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 3:3A:[123] L95-1-->L58: 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][12], 6:4A:[126] L96-->L76: 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][27], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][72], 82:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][127], 246:7A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][474]][249:8A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][886]] [2023-10-12 17:38:57,102 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:57,102 INFO L124 PetriNetUnfolderBase]: 147/248 cut-off events. [2023-10-12 17:38:57,102 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-10-12 17:38:57,102 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:57,103 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [126] L96-->L76: 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] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 189#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 189#[L58, L41, L97, L76]true [2023-10-12 17:38:57,103 INFO L750 eck$LassoCheckResult]: Loop: 189#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 189#[L58, L41, L97, L76]true [2023-10-12 17:38:57,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 301826855, now seen corresponding path program 1 times [2023-10-12 17:38:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396784999] [2023-10-12 17:38:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-10-12 17:38:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 2 times [2023-10-12 17:38:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165446819] [2023-10-12 17:38:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 766698057, now seen corresponding path program 2 times [2023-10-12 17:38:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660926574] [2023-10-12 17:38:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:57,166 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:38:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660926574] [2023-10-12 17:38:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660926574] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:57,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:57,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:38:57,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894229090] [2023-10-12 17:38:57,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:38:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:57,230 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 46 places, 1690 transitions, 28480 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:57,230 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:57,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:57,836 INFO L124 PetriNetUnfolderBase]: 1182/1922 cut-off events. [2023-10-12 17:38:57,836 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2023-10-12 17:38:57,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17765 conditions, 1922 events. 1182/1922 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9734 event pairs, 26 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 11773. Up to 1913 conditions per place. [2023-10-12 17:38:57,861 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 613 selfloop transitions, 98 changer transitions 0/711 dead transitions. [2023-10-12 17:38:57,861 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 48 places, 711 transitions, 13362 flow [2023-10-12 17:38:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:38:57,862 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 711 transitions, 13362 flow [2023-10-12 17:38:57,862 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:38:57,863 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 711 transitions, 13362 flow [2023-10-12 17:38:57,948 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[123] L95-1-->L58: 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][2], 10:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][8], 40:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22], 123:6A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][54], 278:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][113]][535:8A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][199], 536:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][319]] [2023-10-12 17:38:57,951 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[123] L95-1-->L58: 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][2], 10:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][8], 40:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22], 123:6A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][54], 291:7A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][116], 545:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][212]][549:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][331]] [2023-10-12 17:38:57,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:57,951 INFO L124 PetriNetUnfolderBase]: 341/548 cut-off events. [2023-10-12 17:38:57,951 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-10-12 17:38:57,951 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:57,952 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:57,952 INFO L750 eck$LassoCheckResult]: Loop: 97#[L58, L41, L96]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L58, L41, L96]true [2023-10-12 17:38:57,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 772613602, now seen corresponding path program 5 times [2023-10-12 17:38:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545177486] [2023-10-12 17:38:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 6 times [2023-10-12 17:38:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998677763] [2023-10-12 17:38:57,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1818781969, now seen corresponding path program 6 times [2023-10-12 17:38:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395851501] [2023-10-12 17:38:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:58,525 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:58,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:58,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:58,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:58,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:58,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:58,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:58,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:58,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:38:58,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:58,526 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:58,528 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:38:58,532 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:38:58,536 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,688 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:38:58,692 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:38:58,694 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:38:58,698 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:38:58,700 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:38:58,703 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:38:58,705 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:38:58,707 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:38:59,029 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:59,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,031 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:38:59,032 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:38:59,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:59,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:38:59,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,050 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:38:59,053 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:38:59,055 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:38:59,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,091 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:38:59,100 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:38:59,101 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:38:59,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,109 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:59,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,140 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:59,140 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:59,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,180 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:38:59,189 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:38:59,193 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:38:59,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,202 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:59,207 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:38:59,207 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:38:59,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,209 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:38:59,210 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:38:59,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:59,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:59,226 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:59,226 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:38:59,228 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:38:59,233 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:38:59,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,279 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:38:59,279 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:38:59,378 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:38:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-10-12 17:38:59,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:38:59,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,380 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:38:59,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,423 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:38:59,423 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:59,503 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:38:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2023-10-12 17:38:59,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:38:59,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,505 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:38:59,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,544 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:38:59,544 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:59,545 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:59,637 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 288 transitions. [2023-10-12 17:38:59,638 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:38:59,702 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:38:59,702 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:38:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2023-10-12 17:38:59,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 199 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:38:59,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 199 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:38:59,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 199 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:38:59,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,704 INFO L430 stractBuchiCegarLoop]: Abstraction has has 58 places, 7748 transitions, 161728 flow [2023-10-12 17:38:59,704 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:38:59,704 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 58 places, 7748 transitions, 161728 flow [2023-10-12 17:39:00,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:39:01,159 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 10:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][85], 38:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][228], 123:6A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][565], 333:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1193]][855:8A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][2128], 856:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][3421]] [2023-10-12 17:39:01,184 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 10:4A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][85], 38:5A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][228], 123:6A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][565], 345:7A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][1225], 870:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][2256]][871:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][3541]] [2023-10-12 17:39:01,669 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 80:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][229], 227:7A:[142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][556], 606:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1173], 1290:9A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][2912]][1292:10A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][4225]] [2023-10-12 17:39:01,719 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 80:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][229], 228:7A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][564], 619:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1193]][1329:9A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][2128], 1330:10A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][3421]] [2023-10-12 17:39:01,732 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 80:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][229], 228:7A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][564], 619:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1193], 1336:9A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][2992]][1338:10A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][4409]] [2023-10-12 17:39:01,750 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 80:6A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][229], 228:7A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][564], 625:8A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][1225], 1352:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][2256]][1353:10A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][3541]] [2023-10-12 17:39:01,821 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 81:6A:[142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][237], 241:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][580], 655:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1257], 1402:9A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][3169]][1404:10A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][4693]] [2023-10-12 17:39:01,857 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 81:6A:[142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][237], 241:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][580], 660:8A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][1933]][1438:9A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][3243], 1440:10A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][4757]] [2023-10-12 17:39:01,924 ERROR L47 etriNetUnfolderRabin]: [1:1A:[96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 3:3A:[123] L95-1-->L58: 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][24], 6:4A:[126] L96-->L76: 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][53], 20:5A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][156], 82:6A:[132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r][245], 257:7A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][640], 726:8A:[145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1417], 1488:9A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][3249]][1490:10A:[144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][4845]] [2023-10-12 17:39:01,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:01,974 INFO L124 PetriNetUnfolderBase]: 976/1540 cut-off events. [2023-10-12 17:39:01,974 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2023-10-12 17:39:01,974 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:01,975 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= 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_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, 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, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 97#[L58, L41, L96]true [126] L96-->L76: 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] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [2023-10-12 17:39:01,975 INFO L750 eck$LassoCheckResult]: Loop: 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 189#[L58, L41, L97, L76]true [2023-10-12 17:39:01,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1949525053, now seen corresponding path program 3 times [2023-10-12 17:39:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110387570] [2023-10-12 17:39:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash 5185, now seen corresponding path program 2 times [2023-10-12 17:39:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006538476] [2023-10-12 17:39:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:02,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash -887830653, now seen corresponding path program 4 times [2023-10-12 17:39:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:02,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967081193] [2023-10-12 17:39:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:02,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:03,050 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:03,050 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:03,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:03,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:03,050 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:03,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:03,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:03,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:03,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:39:03,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:03,050 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:03,076 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:39:03,079 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:39:03,081 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:39:03,083 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:39:05,474 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:39:05,476 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:39:05,478 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:39:05,480 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:39:05,482 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:39:05,837 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:39:05,838 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2023-10-12 17:39:07,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:07,630 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:07,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,632 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:39:07,634 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:39:07,636 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:39:07,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,647 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:39:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,648 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:39:07,649 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:39:07,651 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:39:07,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-10-12 17:39:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,663 INFO L229 MonitoredProcess]: Starting monitored process 33 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:39:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:39:07,673 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:39:07,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-10-12 17:39:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,692 INFO L229 MonitoredProcess]: Starting monitored process 34 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:39:07,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:39:07,695 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:39:07,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:39:07,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,709 INFO L229 MonitoredProcess]: Starting monitored process 35 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:39:07,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:39:07,711 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:39:07,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-10-12 17:39:07,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,725 INFO L229 MonitoredProcess]: Starting monitored process 36 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:39:07,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:39:07,729 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:39:07,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,736 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:39:07,736 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:39:07,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,815 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2023-10-12 17:39:07,815 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:39:08,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:08,283 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2023-10-12 17:39:08,283 INFO L444 ModelExtractionUtils]: 142 out of 162 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-10-12 17:39:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:08,285 INFO L229 MonitoredProcess]: Starting monitored process 37 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:39:08,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:08,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:39:08,318 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2023-10-12 17:39:08,318 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:08,318 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q3_back, N, i, q3_front) = 1*q3_back + 1*N - 1*i - 1*q3_front Supporting invariants [1*q3_back - 1*q3_front >= 0] [2023-10-12 17:39:08,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:08,345 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:39:08,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:08,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2023-10-12 17:39:08,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:08,536 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:39:08,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:08,649 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:39:08,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2023-10-12 17:39:09,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:39:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 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:39:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 464 transitions. [2023-10-12 17:39:10,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 464 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:39:10,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:10,205 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:10,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:10,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2023-10-12 17:39:10,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:10,376 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:39:10,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:10,476 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:39:10,477 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2023-10-12 17:39:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:39:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 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:39:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 464 transitions. [2023-10-12 17:39:11,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 464 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:39:11,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:11,883 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:11,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:11,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2023-10-12 17:39:11,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:12,063 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:39:12,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:12,164 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:39:12,165 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2023-10-12 17:39:12,165 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 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:39:12,725 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 1430 transitions. [2023-10-12 17:39:12,725 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:39:17,659 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:39:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:39:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 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:39:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 470 transitions. [2023-10-12 17:39:17,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 470 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:39:17,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:17,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 470 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:39:17,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:17,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 470 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:39:17,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:17,662 INFO L430 stractBuchiCegarLoop]: Abstraction has has 106 places, 422152 transitions, 9679888 flow [2023-10-12 17:39:17,662 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:39:17,662 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 106 places, 422152 transitions, 9679888 flow Received shutdown request... [2023-10-12 17:42:30,560 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:42:30,735 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:42:30,740 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:30 BoogieIcfgContainer [2023-10-12 17:42:30,740 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:30,741 INFO L158 Benchmark]: Toolchain (without parser) took 220857.44ms. Allocated memory was 182.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 136.0MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2023-10-12 17:42:30,741 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 182.5MB. Free memory was 137.3MB in the beginning and 137.1MB in the end (delta: 180.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:30,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.59ms. Allocated memory is still 182.5MB. Free memory was 135.8MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:42:30,741 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 182.5MB. Free memory was 134.3MB in the beginning and 133.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:30,742 INFO L158 Benchmark]: RCFGBuilder took 291.61ms. Allocated memory is still 182.5MB. Free memory was 133.1MB in the beginning and 120.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:42:30,742 INFO L158 Benchmark]: BuchiAutomizer took 220504.11ms. Allocated memory was 182.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 120.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2023-10-12 17:42:30,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 182.5MB. Free memory was 137.3MB in the beginning and 137.1MB in the end (delta: 180.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.59ms. Allocated memory is still 182.5MB. Free memory was 135.8MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 182.5MB. Free memory was 134.3MB in the beginning and 133.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 291.61ms. Allocated memory is still 182.5MB. Free memory was 133.1MB in the beginning and 120.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 220504.11ms. Allocated memory was 182.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 120.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (4 trivial, 4 deterministic, 2 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function q3_back + N + -1 * i + -1 * q3_front and consists of 6 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 -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One nondeterministic module has affine ranking function q3_back + N + -1 * i + -1 * q3_front and consists of 10 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 9679888 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 220.4s and 11 iterations. TraceHistogramMax:0. Analysis of lassos took 12.4s. Construction of modules took 1.6s. Büchi inclusion checks took 9.9s. 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 [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1601 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1595 mSDsluCounter, 2088 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1210 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2818 IncrementalHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 878 mSDtfsCounter, 2818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp380 ukn63 mio100 lsp74 div100 bol110 ite100 ukn100 eq184 hnf93 smp100 dnf429 smp46 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 593ms VariablesStem: 32 VariablesLoop: 18 DisjunctsStem: 2 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderRabin. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 37 PlacesBefore, 22 PlacesAfterwards, 30 TransitionsBefore, 15 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 212, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 212, unknown conditional: 0, unknown unconditional: 212] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, 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