/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/counter-determinism.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:05,960 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:06,029 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:41:06,042 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:06,043 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:06,043 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:06,044 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:06,044 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:06,044 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:06,045 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:06,045 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:06,045 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:06,045 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:06,046 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:06,046 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:06,046 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:06,046 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:06,047 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:06,047 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:06,047 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:06,047 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:06,048 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:06,048 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:06,048 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:06,048 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:06,048 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:06,049 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:06,049 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:06,049 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:06,049 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:06,049 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:06,049 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:06,050 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:06,050 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:06,050 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:41:06,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:06,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:06,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:06,270 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:06,277 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:06,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-determinism.wvr.bpl [2023-10-12 17:41:06,279 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-determinism.wvr.bpl' [2023-10-12 17:41:06,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:06,315 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:06,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:06,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:06,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:06,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,335 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:06,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:06,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:06,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:06,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:06,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:06,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:06,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:06,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:06,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/1) ... [2023-10-12 17:41:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:06,384 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:41:06,389 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:41:06,427 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:06,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:06,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:06,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:06,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:06,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:06,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:06,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:06,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:06,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:41:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:41:06,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:41:06,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:41:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:41:06,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:41:06,430 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:41:06,468 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:06,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:06,545 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:06,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:06,563 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:06,565 INFO L201 PluginConnector]: Adding new model counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:06 BoogieIcfgContainer [2023-10-12 17:41:06,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:06,566 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:06,566 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:06,569 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:06,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:06,570 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:06" (1/2) ... [2023-10-12 17:41:06,571 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2af919 and model type counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:06, skipping insertion in model container [2023-10-12 17:41:06,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:06,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:06" (2/2) ... [2023-10-12 17:41:06,572 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-determinism.wvr.bpl [2023-10-12 17:41:06,677 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:41:06,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 118 flow [2023-10-12 17:41:06,717 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:41:06,717 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:41:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 4/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2023-10-12 17:41:06,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 118 flow [2023-10-12 17:41:06,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 94 flow [2023-10-12 17:41:06,730 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:06,742 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 94 flow [2023-10-12 17:41:06,744 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 94 flow [2023-10-12 17:41:06,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 94 flow [2023-10-12 17:41:06,752 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-10-12 17:41:06,752 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:41:06,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 4/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2023-10-12 17:41:06,754 INFO L119 LiptonReduction]: Number of co-enabled transitions 288 [2023-10-12 17:41:07,101 INFO L134 LiptonReduction]: Checked pairs total: 258 [2023-10-12 17:41:07,101 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:41:07,110 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:07,110 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:07,110 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:07,110 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:07,110 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:07,110 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:07,110 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:07,111 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:07,111 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 19 transitions, 62 flow [2023-10-12 17:41:07,113 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][18], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1]][3:3A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][9]] [2023-10-12 17:41:07,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:07,115 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:07,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:07,115 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:07,117 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:07,117 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 19 transitions, 62 flow [2023-10-12 17:41:07,118 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][18], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1]][3:3A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][9]] [2023-10-12 17:41:07,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:07,118 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:07,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:07,118 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:07,122 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [2023-10-12 17:41:07,122 INFO L750 eck$LassoCheckResult]: Loop: 56#[L22-1, L74-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 56#[L22-1, L74-1]true [2023-10-12 17:41:07,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash 5475, now seen corresponding path program 1 times [2023-10-12 17:41:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538807201] [2023-10-12 17:41:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:07,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:41:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591777291] [2023-10-12 17:41:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:07,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 169862, now seen corresponding path program 1 times [2023-10-12 17:41:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596300129] [2023-10-12 17:41:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:07,260 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:07,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:07,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:07,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:07,261 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:07,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:07,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:07,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:07,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:07,262 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:07,272 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:41:07,295 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:41:07,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:07,335 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,339 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:41:07,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:07,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:07,367 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:41:07,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:07,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,382 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:41:07,385 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:41:07,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:07,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:07,501 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:07,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:41:07,505 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:07,505 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:07,505 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:07,505 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:07,505 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:07,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:07,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:07,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:07,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:07,505 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:07,506 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:41:07,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:07,541 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:07,544 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:07,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,556 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:41:07,557 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:41:07,565 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:41:07,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:07,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:07,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:07,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:07,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:07,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:07,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:07,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:07,585 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:07,586 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:07,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,589 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:41:07,590 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:41:07,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:07,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:07,592 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:07,593 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:41:07,601 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:41:07,604 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:07,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:07,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:07,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:07,646 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:07,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:07,647 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:41:07,676 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:41:07,711 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:41:07,780 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:41:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2023-10-12 17:41:07,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:41:07,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:07,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:07,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:07,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:41:07,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:07,795 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 76 transitions, 400 flow [2023-10-12 17:41:07,795 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:41:07,795 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 76 transitions, 400 flow [2023-10-12 17:41:07,800 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][75], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 4:3A:[115] L74-1-->L33-1: 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][26]][5:4A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][48]] [2023-10-12 17:41:07,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:07,801 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:41:07,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:07,801 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:07,801 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [2023-10-12 17:41:07,801 INFO L750 eck$LassoCheckResult]: Loop: 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [2023-10-12 17:41:07,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash 169840, now seen corresponding path program 1 times [2023-10-12 17:41:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196154331] [2023-10-12 17:41:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:07,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 162, now seen corresponding path program 1 times [2023-10-12 17:41:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783001286] [2023-10-12 17:41:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:07,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:07,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 5265171, now seen corresponding path program 1 times [2023-10-12 17:41:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38563504] [2023-10-12 17:41:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:07,869 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:41:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38563504] [2023-10-12 17:41:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38563504] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:07,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:07,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:41:07,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147486318] [2023-10-12 17:41:07,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:07,895 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:07,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:07,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:07,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:07,895 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:07,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:07,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:07,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:07,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:07,896 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:07,896 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:41:07,901 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:41:07,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:07,925 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,943 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:41:07,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:07,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:07,964 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:41:07,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:41:07,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:07,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:07,986 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:41:07,997 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:41:07,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:07,998 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,015 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:08,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:08,020 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:08,020 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:08,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:08,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:08,020 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:08,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:08,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:08,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:08,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:08,021 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:08,021 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:41:08,027 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:41:08,056 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:08,056 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,061 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:41:08,064 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:41:08,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:08,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:08,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:08,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:08,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:08,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:08,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:08,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:08,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:08,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:08,107 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:08,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,108 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:41:08,111 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:41:08,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:08,112 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:08,112 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:08,112 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2023-10-12 17:41:08,118 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:41:08,119 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:08,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:08,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:08,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:08,147 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:08,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:08,147 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:41:08,148 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:41:08,219 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:41:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:41:08,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:08,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:08,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:41:08,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:41:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:41:08,225 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 37 places, 380 transitions, 2760 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:41:08,225 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:08,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:08,319 INFO L124 PetriNetUnfolderBase]: 450/619 cut-off events. [2023-10-12 17:41:08,319 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-10-12 17:41:08,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 619 events. 450/619 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1677 event pairs, 106 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 1908. Up to 553 conditions per place. [2023-10-12 17:41:08,331 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 75 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2023-10-12 17:41:08,331 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 79 transitions, 719 flow [2023-10-12 17:41:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:41:08,333 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 79 transitions, 719 flow [2023-10-12 17:41:08,333 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:41:08,333 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 79 transitions, 719 flow [2023-10-12 17:41:08,335 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][0], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 6:3A:[115] L74-1-->L33-1: 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], 17:4A:[118] L75-->L45-1: 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][11]][18:5A:[133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1][26]] [2023-10-12 17:41:08,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:08,336 INFO L124 PetriNetUnfolderBase]: 6/17 cut-off events. [2023-10-12 17:41:08,336 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:41:08,336 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:08,336 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [118] L75-->L45-1: 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] 127#[L22-1, L45-1, L33-1, L76]true [2023-10-12 17:41:08,336 INFO L750 eck$LassoCheckResult]: Loop: 127#[L22-1, L45-1, L33-1, L76]true [133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1] 127#[L22-1, L45-1, L33-1, L76]true [2023-10-12 17:41:08,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash 5265158, now seen corresponding path program 1 times [2023-10-12 17:41:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594553239] [2023-10-12 17:41:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 164, now seen corresponding path program 1 times [2023-10-12 17:41:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384622774] [2023-10-12 17:41:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 163220031, now seen corresponding path program 1 times [2023-10-12 17:41:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474731874] [2023-10-12 17:41:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,397 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:08,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:08,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:08,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:08,398 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:08,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:08,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:08,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:08,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:08,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:08,399 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:41:08,401 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:41:08,418 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:08,418 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:08,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,432 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:41:08,432 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:41:08,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:08,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,473 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:41:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,474 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:41:08,477 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:41:08,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:08,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,501 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:41:08,501 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter2=0} Honda state: {counter2=0} Generalized eigenvectors: [{counter2=1}, {counter2=-6}, {counter2=6}] Lambdas: [7, 2, 1] Nus: [1, 1] [2023-10-12 17:41:08,511 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:41:08,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,513 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:41:08,515 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:41:08,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:08,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,567 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:41:08,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,569 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:41:08,601 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:41:08,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:08,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,691 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:08,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:41:08,705 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:08,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:08,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:08,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:08,705 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:08,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:08,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:08,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:08,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:08,706 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:08,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:41:08,709 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:41:08,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:08,736 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,738 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:41:08,759 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:41:08,760 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:41:08,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:08,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:08,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:08,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:08,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:08,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:08,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:08,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:08,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,795 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:41:08,797 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:41:08,799 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:41:08,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:08,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:08,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:08,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:08,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:08,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:08,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:08,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:08,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:08,815 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,817 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:41:08,818 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:41:08,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:08,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:08,819 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:08,819 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, N1) = -1*j1 + 1*N1 Supporting invariants [] [2023-10-12 17:41:08,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:08,825 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:08,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:08,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:08,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:08,856 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:08,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:08,856 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:41:08,857 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:41:08,928 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:41:08,930 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:41:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2023-10-12 17:41:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:41:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:08,932 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 316 transitions, 3508 flow [2023-10-12 17:41:08,932 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:41:08,932 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 316 transitions, 3508 flow [2023-10-12 17:41:08,942 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][2], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 6:3A:[115] L74-1-->L33-1: 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][18], 15:4A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][42], 36:5A:[136] L22-1-->thread1EXIT: Formula: (<= v_N1_10 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_10} OutVars{i1=v_i1_10, N1=v_N1_10} AuxVars[] AssignedVars[][90]][37:6A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][162]] [2023-10-12 17:41:08,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:08,943 INFO L124 PetriNetUnfolderBase]: 17/36 cut-off events. [2023-10-12 17:41:08,943 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:41:08,943 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:08,944 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 91#[L22-1, L75, L33-1]true [136] L22-1-->thread1EXIT: Formula: (<= v_N1_10 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_10} OutVars{i1=v_i1_10, N1=v_N1_10} AuxVars[] AssignedVars[] 165#[L75, L33-1, thread1EXIT]true [2023-10-12 17:41:08,944 INFO L750 eck$LassoCheckResult]: Loop: 165#[L75, L33-1, thread1EXIT]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 165#[L75, L33-1, thread1EXIT]true [2023-10-12 17:41:08,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 163220623, now seen corresponding path program 1 times [2023-10-12 17:41:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989602434] [2023-10-12 17:41:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 162, now seen corresponding path program 2 times [2023-10-12 17:41:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261628189] [2023-10-12 17:41:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 764872148, now seen corresponding path program 1 times [2023-10-12 17:41:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395338765] [2023-10-12 17:41:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:09,012 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:09,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:09,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:09,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:09,012 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:09,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:09,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:09,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:09,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:09,012 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:09,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:09,019 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:41:09,050 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:09,050 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,069 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:41:09,070 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:41:09,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:09,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:09,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:09,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,109 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:41:09,109 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:41:09,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:09,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:09,133 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:09,137 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:41:09,137 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:09,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:09,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:09,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:09,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:09,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:09,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:09,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:09,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:09,137 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:09,138 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:41:09,142 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:41:09,167 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:09,167 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:09,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,168 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:41:09,170 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:41:09,171 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:41:09,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:09,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:09,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:09,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:09,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:09,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:09,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:09,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:09,203 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:41:09,203 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,211 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:41:09,214 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:41:09,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:09,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:09,214 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:09,215 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2023-10-12 17:41:09,218 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:41:09,218 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:09,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,249 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,249 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:41:09,250 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:41:09,312 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:41:09,313 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:41:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:41:09,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,313 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 1580 transitions, 20700 flow [2023-10-12 17:41:09,314 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:41:09,314 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 1580 transitions, 20700 flow [2023-10-12 17:41:09,323 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][12], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][32], 6:3A:[115] L74-1-->L33-1: 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][92], 15:4A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][212], 40:5A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][512]][42:6A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][812]] [2023-10-12 17:41:09,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:09,323 INFO L124 PetriNetUnfolderBase]: 19/41 cut-off events. [2023-10-12 17:41:09,323 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:41:09,324 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:09,324 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [2023-10-12 17:41:09,324 INFO L750 eck$LassoCheckResult]: Loop: 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [2023-10-12 17:41:09,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 163220618, now seen corresponding path program 1 times [2023-10-12 17:41:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167234669] [2023-10-12 17:41:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:09,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:09,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:09,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash 162, now seen corresponding path program 3 times [2023-10-12 17:41:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:09,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309587374] [2023-10-12 17:41:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:09,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:09,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:09,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 764871993, now seen corresponding path program 2 times [2023-10-12 17:41:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420758192] [2023-10-12 17:41:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,373 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:41:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420758192] [2023-10-12 17:41:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420758192] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:41:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378274671] [2023-10-12 17:41:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:09,401 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:41:09,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:41:09,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:09,417 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:09,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:09,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:09,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:09,418 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:09,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:09,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:09,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:09,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:09,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:09,418 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:41:09,422 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:41:09,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:09,452 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,453 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:41:09,455 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:41:09,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:09,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:09,469 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:41:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,470 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:41:09,471 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:41:09,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:09,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:09,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:09,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:41:09,491 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:09,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:09,491 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:09,491 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:09,491 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:09,491 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,492 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:09,492 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:09,492 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:09,492 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:09,492 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:09,492 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:41:09,497 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:41:09,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:09,522 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:09,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,523 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:41:09,525 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:41:09,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:41:09,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:09,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:09,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:09,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:09,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:09,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:09,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:09,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:09,537 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:09,537 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,538 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:41:09,541 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:41:09,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:09,541 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:09,541 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:09,541 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2023-10-12 17:41:09,546 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:41:09,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:09,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,586 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,586 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:41:09,587 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:41:09,683 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:41:09,683 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:41:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:41:09,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:09,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:09,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:09,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:09,685 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 50 places, 7900 transitions, 119300 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:41:09,685 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:09,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:10,274 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:41:11,878 INFO L124 PetriNetUnfolderBase]: 2829/3846 cut-off events. [2023-10-12 17:41:11,878 INFO L125 PetriNetUnfolderBase]: For 907/907 co-relation queries the response was YES. [2023-10-12 17:41:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31706 conditions, 3846 events. 2829/3846 cut-off events. For 907/907 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15536 event pairs, 160 based on Foata normal form. 0/2332 useless extension candidates. Maximal degree in co-relation 22448. Up to 3610 conditions per place. [2023-10-12 17:41:11,913 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 753 selfloop transitions, 58 changer transitions 0/811 dead transitions. [2023-10-12 17:41:11,914 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 49 places, 811 transitions, 13639 flow [2023-10-12 17:41:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:41:11,914 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 811 transitions, 13639 flow [2023-10-12 17:41:11,914 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:41:11,915 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 49 places, 811 transitions, 13639 flow [2023-10-12 17:41:11,923 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][0], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[115] L74-1-->L33-1: 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], 16:4A:[118] L75-->L45-1: 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][11], 58:5A:[121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][35]][59:6A:[129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2][108]] [2023-10-12 17:41:11,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:11,923 INFO L124 PetriNetUnfolderBase]: 27/58 cut-off events. [2023-10-12 17:41:11,923 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-10-12 17:41:11,923 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:11,924 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [118] L75-->L45-1: 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] 127#[L22-1, L45-1, L33-1, L76]true [121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [2023-10-12 17:41:11,924 INFO L750 eck$LassoCheckResult]: Loop: 250#[L22-1, L45-1, L33-1, L56-1, L77]true [129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [2023-10-12 17:41:11,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 163220019, now seen corresponding path program 1 times [2023-10-12 17:41:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574429495] [2023-10-12 17:41:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:11,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:11,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:11,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2023-10-12 17:41:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896772009] [2023-10-12 17:41:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:11,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:11,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:11,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash 764853422, now seen corresponding path program 1 times [2023-10-12 17:41:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:11,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717726727] [2023-10-12 17:41:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:11,967 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:41:11,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:11,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717726727] [2023-10-12 17:41:11,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717726727] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:11,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:11,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:41:11,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228838484] [2023-10-12 17:41:11,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:11,984 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:11,984 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:11,984 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:11,984 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:11,984 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:11,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:11,985 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:11,985 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:11,985 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:41:11,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:11,985 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:11,987 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:41:11,990 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:41:12,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:12,011 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,012 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:41:12,014 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:41:12,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:12,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:12,035 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:41:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,037 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:41:12,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:12,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:12,050 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:41:12,062 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:12,065 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:41:12,065 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:12,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:12,065 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:12,065 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:12,065 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:12,065 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,065 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:12,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:12,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:41:12,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:12,065 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:12,066 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:41:12,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:41:12,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:12,101 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:12,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,105 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:41:12,107 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:41:12,109 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:41:12,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:12,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:12,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:12,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:12,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:12,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:12,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:12,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:12,120 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:12,120 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,121 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:41:12,128 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:41:12,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:12,129 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:12,129 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:12,129 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter2) = 1*counter2 Supporting invariants [] [2023-10-12 17:41:12,134 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:41:12,135 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:12,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:12,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:12,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:12,171 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:12,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:12,171 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:41:12,172 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:41:12,245 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:41:12,245 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:41:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:41:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:41:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:41:12,247 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 54 places, 4055 transitions, 76305 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:12,247 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:12,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:12,306 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:41:16,159 INFO L124 PetriNetUnfolderBase]: 6888/9475 cut-off events. [2023-10-12 17:41:16,159 INFO L125 PetriNetUnfolderBase]: For 2417/2417 co-relation queries the response was YES. [2023-10-12 17:41:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96786 conditions, 9475 events. 6888/9475 cut-off events. For 2417/2417 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 46012 event pairs, 105 based on Foata normal form. 0/5900 useless extension candidates. Maximal degree in co-relation 66094. Up to 8906 conditions per place. [2023-10-12 17:41:16,269 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 2466 selfloop transitions, 145 changer transitions 0/2611 dead transitions. [2023-10-12 17:41:16,270 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 55 places, 2611 transitions, 53627 flow [2023-10-12 17:41:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:41:16,270 INFO L430 stractBuchiCegarLoop]: Abstraction has has 55 places, 2611 transitions, 53627 flow [2023-10-12 17:41:16,270 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:41:16,271 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 55 places, 2611 transitions, 53627 flow [2023-10-12 17:41:16,464 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][0], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[115] L74-1-->L33-1: 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], 9:4A:[118] L75-->L45-1: 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][8], 33:5A:[121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][23], 153:6A:[133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1][68], 563:7A:[130] L33-1-->thread2EXIT: Formula: (<= v_N2_10 v_i2_14) InVars {i2=v_i2_14, N2=v_N2_10} OutVars{i2=v_i2_14, N2=v_N2_10} AuxVars[] AssignedVars[][221]][569:8A:[129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2][559]] [2023-10-12 17:41:16,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:16,465 INFO L124 PetriNetUnfolderBase]: 381/568 cut-off events. [2023-10-12 17:41:16,466 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-10-12 17:41:16,466 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:16,467 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [118] L75-->L45-1: 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] 127#[L22-1, L45-1, L33-1, L76]true [121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [130] L33-1-->thread2EXIT: Formula: (<= v_N2_10 v_i2_14) InVars {i2=v_i2_14, N2=v_N2_10} OutVars{i2=v_i2_14, N2=v_N2_10} AuxVars[] AssignedVars[] 295#[L22-1, thread2EXIT, L45-1, L56-1, L77]true [2023-10-12 17:41:16,467 INFO L750 eck$LassoCheckResult]: Loop: 295#[L22-1, thread2EXIT, L45-1, L56-1, L77]true [129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2] 295#[L22-1, thread2EXIT, L45-1, L56-1, L77]true [2023-10-12 17:41:16,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2059347440, now seen corresponding path program 1 times [2023-10-12 17:41:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947775244] [2023-10-12 17:41:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:16,512 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:41:16,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:16,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947775244] [2023-10-12 17:41:16,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947775244] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:16,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:16,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:41:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772915554] [2023-10-12 17:41:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:16,513 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:41:16,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 2 times [2023-10-12 17:41:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119179467] [2023-10-12 17:41:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:16,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:16,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:16,534 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:16,534 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:16,534 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:16,534 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:16,534 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:16,534 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,534 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:16,534 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:16,534 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:41:16,534 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:16,534 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:16,535 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:41:16,539 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:41:16,559 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:16,559 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:16,560 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:41:16,562 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:41:16,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:16,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:16,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:16,585 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:41:16,585 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:41:16,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:16,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:16,701 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:16,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:16,705 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:16,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:16,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:16,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:16,705 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:16,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:16,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:16,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:41:16,705 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:16,705 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:16,706 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:41:16,716 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:41:16,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:16,737 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:16,738 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:41:16,741 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:41:16,742 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:41:16,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:16,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:16,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:16,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:16,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:16,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:16,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:16,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:16,753 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:16,753 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:16,754 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:41:16,755 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:41:16,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:16,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:16,758 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:16,758 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, j2) = 1*N2 - 1*j2 Supporting invariants [] [2023-10-12 17:41:16,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:16,763 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:16,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:16,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:16,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:16,804 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:16,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:16,805 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:41:16,805 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:41:16,946 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:41:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2023-10-12 17:41:16,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:41:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:16,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:16,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 240 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:41:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:16,949 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 59 places, 10444 transitions, 235396 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:41:16,949 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:16,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:17,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:32,199 INFO L124 PetriNetUnfolderBase]: 7332/10301 cut-off events. [2023-10-12 17:41:32,199 INFO L125 PetriNetUnfolderBase]: For 2929/2929 co-relation queries the response was YES. [2023-10-12 17:41:32,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125934 conditions, 10301 events. 7332/10301 cut-off events. For 2929/2929 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 53540 event pairs, 56 based on Foata normal form. 48/6595 useless extension candidates. Maximal degree in co-relation 83352. Up to 9733 conditions per place. [2023-10-12 17:41:32,292 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 4267 selfloop transitions, 229 changer transitions 0/4496 dead transitions. [2023-10-12 17:41:32,292 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 61 places, 4496 transitions, 110445 flow [2023-10-12 17:41:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:41:32,293 INFO L430 stractBuchiCegarLoop]: Abstraction has has 61 places, 4496 transitions, 110445 flow [2023-10-12 17:41:32,293 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:41:32,293 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 61 places, 4496 transitions, 110445 flow [2023-10-12 17:41:32,599 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][0], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[115] L74-1-->L33-1: 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], 11:4A:[118] L75-->L45-1: 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][9], 40:5A:[121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][26], 158:6A:[133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1][87], 632:7A:[129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2][298]][636:8A:[129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2][850]] [2023-10-12 17:41:32,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:32,600 INFO L124 PetriNetUnfolderBase]: 420/635 cut-off events. [2023-10-12 17:41:32,600 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-10-12 17:41:32,600 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:32,600 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [118] L75-->L45-1: 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] 127#[L22-1, L45-1, L33-1, L76]true [121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [133] L45-1-->L45-1: Formula: (and (= (+ v_counter2_27 1) v_counter2_26) (= v_j1_14 (+ v_j1_15 1)) (< v_j1_15 v_N1_8)) InVars {counter2=v_counter2_27, j1=v_j1_15, N1=v_N1_8} OutVars{counter2=v_counter2_26, j1=v_j1_14, N1=v_N1_8} AuxVars[] AssignedVars[counter2, j1] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [2023-10-12 17:41:32,600 INFO L750 eck$LassoCheckResult]: Loop: 250#[L22-1, L45-1, L33-1, L56-1, L77]true [129] L56-1-->L56-1: Formula: (and (< v_j2_19 v_N2_8) (< 0 v_counter2_23) (= (+ v_counter2_22 1) v_counter2_23) (= v_j2_18 (+ v_j2_19 1))) InVars {counter2=v_counter2_23, j2=v_j2_19, N2=v_N2_8} OutVars{counter2=v_counter2_22, j2=v_j2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter2, j2] 250#[L22-1, L45-1, L33-1, L56-1, L77]true [2023-10-12 17:41:32,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2059347441, now seen corresponding path program 1 times [2023-10-12 17:41:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277310350] [2023-10-12 17:41:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:32,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:32,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:32,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 3 times [2023-10-12 17:41:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940098289] [2023-10-12 17:41:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:32,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:32,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:32,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 584738898, now seen corresponding path program 2 times [2023-10-12 17:41:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:32,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626452138] [2023-10-12 17:41:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:32,629 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:41:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626452138] [2023-10-12 17:41:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626452138] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:32,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:41:32,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144644285] [2023-10-12 17:41:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:32,646 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:32,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:32,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:32,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:32,646 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:32,646 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,646 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:32,646 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:32,646 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:41:32,646 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:32,646 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:32,647 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:41:32,651 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:41:32,672 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:32,672 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:32,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:32,673 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:41:32,673 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:41:32,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:32,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:32,688 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:41:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:32,689 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:41:32,690 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:41:32,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:32,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:32,705 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:32,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:32,707 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:32,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:32,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:32,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:32,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:32,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:32,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:32,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:41:32,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:32,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:32,708 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:41:32,712 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:41:32,732 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:32,732 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:32,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:32,733 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:41:32,734 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:41:32,736 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:41:32,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:32,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:32,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:32,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:32,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:32,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:32,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:32,744 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:32,745 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:41:32,745 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:32,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:32,746 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:41:32,748 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:41:32,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:32,750 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:32,750 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:32,750 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter2) = 1*counter2 Supporting invariants [] [2023-10-12 17:41:32,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:32,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:32,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:32,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:32,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:32,783 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:32,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:32,783 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:41:32,784 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:41:33,019 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:41:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:41:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:41:33,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:33,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:41:33,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:33,021 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 66 places, 22480 transitions, 597185 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:33,021 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:33,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:34,408 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:43:56,502 INFO L124 PetriNetUnfolderBase]: 23741/33646 cut-off events. [2023-10-12 17:43:56,502 INFO L125 PetriNetUnfolderBase]: For 10287/10287 co-relation queries the response was YES. [2023-10-12 17:43:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477280 conditions, 33646 events. 23741/33646 cut-off events. For 10287/10287 co-relation queries the response was YES. Maximal size of possible extension queue 1703. Compared 209986 event pairs, 123 based on Foata normal form. 0/21548 useless extension candidates. Maximal degree in co-relation 311592. Up to 31950 conditions per place. [2023-10-12 17:43:56,812 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 11417 selfloop transitions, 1691 changer transitions 0/13108 dead transitions. [2023-10-12 17:43:56,812 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 68 places, 13108 transitions, 373699 flow [2023-10-12 17:43:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:43:56,813 INFO L430 stractBuchiCegarLoop]: Abstraction has has 68 places, 13108 transitions, 373699 flow [2023-10-12 17:43:56,813 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:43:56,813 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 68 places, 13108 transitions, 373699 flow [2023-10-12 17:44:00,066 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][0], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[115] L74-1-->L33-1: 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], 8:4A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][7], 38:5A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][22], 156:6A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][83], 552:7A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][265], 1506:8A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][727]][1508:9A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][1647]] [2023-10-12 17:44:00,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:44:00,067 INFO L124 PetriNetUnfolderBase]: 1030/1507 cut-off events. [2023-10-12 17:44:00,067 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2023-10-12 17:44:00,067 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:44:00,067 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]true [142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[] 54#[L74]true [112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 56#[L22-1, L74-1]true [115] L74-1-->L33-1: 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] 91#[L22-1, L75, L33-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 91#[L22-1, L75, L33-1]true [137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1] 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [2023-10-12 17:44:00,067 INFO L750 eck$LassoCheckResult]: Loop: 91#[L22-1, L75, L33-1]true [131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2] 91#[L22-1, L75, L33-1]true [2023-10-12 17:44:00,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 602587801, now seen corresponding path program 3 times [2023-10-12 17:44:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:44:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211832926] [2023-10-12 17:44:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:44:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:44:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:44:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:44:00,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash 162, now seen corresponding path program 4 times [2023-10-12 17:44:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:44:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626525496] [2023-10-12 17:44:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:44:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:44:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:44:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:44:00,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1500352778, now seen corresponding path program 4 times [2023-10-12 17:44:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:44:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551757185] [2023-10-12 17:44:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:44:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:44:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:44:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:44:00,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:44:00,119 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:44:00,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:44:00,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:44:00,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:44:00,119 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:44:00,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:44:00,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:44:00,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration9_Loop [2023-10-12 17:44:00,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:44:00,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:44:00,120 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:44:00,123 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:44:00,140 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:44:00,140 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:44:00,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:44:00,142 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:44:00,145 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:44:00,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:44:00,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:44:00,175 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:44:00,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:44:00,176 INFO L229 MonitoredProcess]: Starting monitored process 38 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:44:00,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:44:00,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:44:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:44:00,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:44:00,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-10-12 17:44:00,209 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:44:00,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:44:00,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:44:00,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:44:00,210 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:44:00,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:44:00,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:44:00,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_BEv2_Iteration9_Loop [2023-10-12 17:44:00,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:44:00,210 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:44:00,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:44:00,214 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:44:00,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:44:00,232 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:44:00,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:44:00,233 INFO L229 MonitoredProcess]: Starting monitored process 39 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:44:00,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:44:00,236 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:44:00,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:44:00,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:44:00,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:44:00,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:44:00,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:44:00,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:44:00,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:44:00,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:44:00,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:44:00,254 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:44:00,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:44:00,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:44:00,255 INFO L229 MonitoredProcess]: Starting monitored process 40 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:44:00,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:44:00,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:44:00,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:44:00,259 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:44:00,259 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2023-10-12 17:44:00,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:44:00,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:44:00,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:00,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:44:00,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:00,291 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:44:00,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:00,292 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:44:00,292 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:44:01,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:44:01,141 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:44:01,141 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:44:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:44:01,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:44:01,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:44:01,142 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:44:01,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:01,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:44:01,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:01,175 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:44:01,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:01,175 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:44:01,175 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:44:02,225 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:44:02,226 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:44:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:44:02,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:44:02,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:44:02,227 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:44:02,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:02,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:44:02,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:44:02,283 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:44:02,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:44:02,283 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:44:02,284 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:44:02,284 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:44:02,379 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 346 transitions. [2023-10-12 17:44:02,380 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:44:04,229 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:44:04,229 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:44:04,230 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:44:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2023-10-12 17:44:04,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 237 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:44:04,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:44:04,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 237 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:44:04,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:44:04,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 237 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:44:04,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:44:04,231 INFO L430 stractBuchiCegarLoop]: Abstraction has has 78 places, 150264 transitions, 4588020 flow [2023-10-12 17:44:04,231 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:44:04,231 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 78 places, 150264 transitions, 4588020 flow [2023-10-12 17:45:31,987 ERROR L47 etriNetUnfolderRabin]: [1:1A:[142] $Ultimate##0-->L74: Formula: (and (= v_counter1_36 0) (= v_i1_20 0) (= v_i2_24 0) (= v_counter2_36 0) (= v_j1_20 0) (= v_j2_24 0) (= v_N2_16 v_N1_16)) InVars {counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} OutVars{counter2=v_counter2_36, counter1=v_counter1_36, j2=v_j2_24, i1=v_i1_20, i2=v_i2_24, j1=v_j1_20, N2=v_N2_16, N1=v_N1_16} AuxVars[] AssignedVars[][6], 2:2A:[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][19], 3:3A:[115] L74-1-->L33-1: 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][30], 8:4A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][85], 37:5A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][252], 154:6A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][931], 549:7A:[137] L22-1-->L22-1: Formula: (and (< v_i1_13 v_N1_12) (= v_i1_12 (+ v_i1_13 1)) (= (+ v_counter1_31 1) v_counter1_30)) InVars {counter1=v_counter1_31, i1=v_i1_13, N1=v_N1_12} OutVars{counter1=v_counter1_30, i1=v_i1_12, N1=v_N1_12} AuxVars[] AssignedVars[counter1, i1][2953], 1876:8A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][8104]][1877:9A:[131] L33-1-->L33-1: Formula: (and (< v_i2_17 v_N2_12) (< 0 v_counter1_23) (= (+ v_i2_17 1) v_i2_16) (= (+ v_counter1_22 1) v_counter1_23)) InVars {counter1=v_counter1_23, i2=v_i2_17, N2=v_N2_12} OutVars{counter1=v_counter1_22, i2=v_i2_16, N2=v_N2_12} AuxVars[] AssignedVars[counter1, i2][18427]] Received shutdown request... [2023-10-12 17:45:41,553 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:45:41,589 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:45:41,593 INFO L201 PluginConnector]: Adding new model counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:45:41 BoogieIcfgContainer [2023-10-12 17:45:41,593 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:45:41,593 INFO L158 Benchmark]: Toolchain (without parser) took 275278.82ms. Allocated memory was 219.2MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 168.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:45:41,593 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 219.2MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:45:41,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.10ms. Allocated memory is still 219.2MB. Free memory was 167.9MB in the beginning and 166.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:45:41,594 INFO L158 Benchmark]: Boogie Preprocessor took 21.25ms. Allocated memory is still 219.2MB. Free memory was 166.4MB in the beginning and 165.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:45:41,594 INFO L158 Benchmark]: RCFGBuilder took 204.70ms. Allocated memory is still 219.2MB. Free memory was 165.2MB in the beginning and 154.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:45:41,594 INFO L158 Benchmark]: BuchiAutomizer took 275026.69ms. Allocated memory was 219.2MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 154.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:45:41,595 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.25ms. Allocated memory is still 219.2MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.10ms. Allocated memory is still 219.2MB. Free memory was 167.9MB in the beginning and 166.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.25ms. Allocated memory is still 219.2MB. Free memory was 166.4MB in the beginning and 165.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 204.70ms. Allocated memory is still 219.2MB. Free memory was 165.2MB in the beginning and 154.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 275026.69ms. Allocated memory was 219.2MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 154.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.6GB. 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 14 terminating modules (5 trivial, 8 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function counter1 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + N1 and consists of 4 locations. One deterministic module has affine ranking function counter1 and consists of 4 locations. One deterministic module has affine ranking function counter1 and consists of 4 locations. One deterministic module has affine ranking function counter2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j2 + N2 and consists of 4 locations. One deterministic module has affine ranking function counter2 and consists of 4 locations. One nondeterministic module has affine ranking function counter1 and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 4588020 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 274.8s and 10 iterations. TraceHistogramMax:0. Analysis of lassos took 2.6s. Construction of modules took 0.6s. Büchi inclusion checks took 170.0s. 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 [8, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1330 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1319 mSDsluCounter, 894 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 268 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 626 mSDtfsCounter, 1155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT4 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.4s - 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.4s, 44 PlacesBefore, 28 PlacesAfterwards, 35 TransitionsBefore, 19 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 3 FixpointIterations, 9 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 258, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 168, unknown conditional: 0, unknown unconditional: 168] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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