/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:24:27,541 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:24:27,600 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:24:27,722 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:24:27,722 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:24:27,722 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:24:27,723 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:24:27,724 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:24:27,724 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:24:27,724 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:24:27,724 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:24:27,725 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:24:27,725 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:24:27,725 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:24:27,725 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:24:27,725 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:24:27,726 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:24:27,726 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:24:27,726 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:24:27,726 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:24:27,727 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:24:27,727 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:24:27,727 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:24:27,727 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:24:27,727 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:24:27,728 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:24:27,728 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:24:27,728 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:24:27,728 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:24:27,728 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:24:27,729 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:24:27,729 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:24:27,729 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:24:27,730 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:24:27,730 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:24:27,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:24:27,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:24:27,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:24:27,884 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:24:27,885 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:24:27,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2023-10-12 17:24:27,886 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2023-10-12 17:24:27,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:24:27,905 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:24:27,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:24:27,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:24:27,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:24:27,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,924 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:24:27,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:24:27,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:24:27,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:24:27,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:24:27,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:24:27,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:24:27,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:24:27,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:24:27,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/1) ... [2023-10-12 17:24:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:24:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:24:27,995 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:24:28,002 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:24:28,038 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:24:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:24:28,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:24:28,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:24:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:24:28,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:24:28,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:24:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:24:28,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:24:28,051 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:24:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:24:28,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:24:28,052 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:24:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:24:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:24:28,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2023-10-12 17:24:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-10-12 17:24:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-10-12 17:24:28,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2023-10-12 17:24:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-10-12 17:24:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-10-12 17:24:28,058 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:24:28,112 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:24:28,114 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:24:28,300 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:24:28,327 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:24:28,327 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-10-12 17:24:28,329 INFO L201 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:24:28 BoogieIcfgContainer [2023-10-12 17:24:28,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:24:28,329 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:24:28,329 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:24:28,332 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:24:28,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:24:28,333 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:24:27" (1/2) ... [2023-10-12 17:24:28,334 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50d7e368 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:24:28, skipping insertion in model container [2023-10-12 17:24:28,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:24:28,334 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:24:28" (2/2) ... [2023-10-12 17:24:28,335 INFO L332 chiAutomizerObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2023-10-12 17:24:28,407 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-10-12 17:24:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 230 flow [2023-10-12 17:24:28,450 INFO L124 PetriNetUnfolderBase]: 8/61 cut-off events. [2023-10-12 17:24:28,450 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:24:28,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 61 events. 8/61 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2023-10-12 17:24:28,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 230 flow [2023-10-12 17:24:28,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 170 flow [2023-10-12 17:24:28,462 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:24:28,471 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 61 transitions, 170 flow [2023-10-12 17:24:28,473 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 61 transitions, 170 flow [2023-10-12 17:24:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 61 transitions, 170 flow [2023-10-12 17:24:28,490 INFO L124 PetriNetUnfolderBase]: 8/61 cut-off events. [2023-10-12 17:24:28,490 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:24:28,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 61 events. 8/61 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2023-10-12 17:24:28,492 INFO L119 LiptonReduction]: Number of co-enabled transitions 1888 [2023-10-12 17:24:28,582 INFO L134 LiptonReduction]: Checked pairs total: 7686 [2023-10-12 17:24:28,582 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:24:28,591 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:24:28,592 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:24:28,592 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:24:28,592 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:24:28,592 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:24:28,592 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:24:28,592 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:24:28,593 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:24:28,593 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 59 transitions, 166 flow [2023-10-12 17:24:28,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:28,603 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-10-12 17:24:28,603 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:24:28,603 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:28,606 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:24:28,606 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 59 transitions, 166 flow [2023-10-12 17:24:28,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:28,613 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-10-12 17:24:28,613 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:24:28,613 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:28,617 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [130] $Ultimate##0-->L59: Formula: (and (not v_f1_2_6) (not v_f2_3_6)) InVars {} OutVars{f2_3=v_f2_3_6, f1_2=v_f1_2_6} AuxVars[] AssignedVars[f2_3, f1_2] 94#[L59, L116-1]true [198] L59-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_4) (= 2 v_thread2Thread1of1ForFork0_thidvar1_4)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 96#[L29, L63, L116-1]true [2023-10-12 17:24:28,617 INFO L750 eck$LassoCheckResult]: Loop: 96#[L29, L63, L116-1]true [137] L29-->L31: Formula: (= v_x_0_1 v_temp_4_1) InVars {x_0=v_x_0_1} OutVars{temp_4=v_temp_4_1, x_0=v_x_0_1} AuxVars[] AssignedVars[temp_4] 99#[L31, L63, L116-1]true [138] L31-->L32: Formula: (= (+ v_temp_4_2 1) v_x_0_2) InVars {temp_4=v_temp_4_2} OutVars{temp_4=v_temp_4_2, x_0=v_x_0_2} AuxVars[] AssignedVars[x_0] 101#[L63, L116-1, L32]true [139] L32-->L33: Formula: v_f1_2_2 InVars {} OutVars{f1_2=v_f1_2_2} AuxVars[] AssignedVars[f1_2] 103#[L33, L63, L116-1]true [140] L33-->L34: Formula: v_f2_3_3 InVars {f2_3=v_f2_3_3} OutVars{f2_3=v_f2_3_3} AuxVars[] AssignedVars[] 105#[L34, L63, L116-1]true [141] L34-->L35: Formula: (= v_y_1_1 v_temp_5_1) InVars {y_1=v_y_1_1} OutVars{y_1=v_y_1_1, temp_5=v_temp_5_1} AuxVars[] AssignedVars[temp_5] 107#[L35, L63, L116-1]true [142] L35-->L36: Formula: (= (+ v_temp_5_2 1) v_y_1_2) InVars {temp_5=v_temp_5_2} OutVars{y_1=v_y_1_2, temp_5=v_temp_5_2} AuxVars[] AssignedVars[y_1] 109#[L63, L116-1, L36]true [143] L36-->L37: Formula: (not v_f1_2_3) InVars {} OutVars{f1_2=v_f1_2_3} AuxVars[] AssignedVars[f1_2] 111#[L63, L116-1, L37]true [144] L37-->L29: Formula: (not v_f2_3_2) InVars {f2_3=v_f2_3_2} OutVars{f2_3=v_f2_3_2} AuxVars[] AssignedVars[] 96#[L29, L63, L116-1]true [2023-10-12 17:24:28,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash 3996222, now seen corresponding path program 1 times [2023-10-12 17:24:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114192121] [2023-10-12 17:24:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:28,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:24:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:28,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:24:28,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1526064251, now seen corresponding path program 1 times [2023-10-12 17:24:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423162499] [2023-10-12 17:24:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:28,741 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:24:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423162499] [2023-10-12 17:24:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423162499] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:24:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145523471] [2023-10-12 17:24:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:28,749 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:24:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:24:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:24:28,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 166 flow. Second operand has 3 states, 2 states have (on average 4.0) 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:24:28,771 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:31,835 INFO L124 PetriNetUnfolderBase]: 38788/51686 cut-off events. [2023-10-12 17:24:31,835 INFO L125 PetriNetUnfolderBase]: For 9302/9302 co-relation queries the response was YES. [2023-10-12 17:24:31,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112852 conditions, 51686 events. 38788/51686 cut-off events. For 9302/9302 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 273816 event pairs, 14620 based on Foata normal form. 1040/45470 useless extension candidates. Maximal degree in co-relation 112060. Up to 26944 conditions per place. [2023-10-12 17:24:32,281 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 98 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2023-10-12 17:24:32,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:34,414 INFO L124 PetriNetUnfolderBase]: 38788/51686 cut-off events. [2023-10-12 17:24:34,414 INFO L125 PetriNetUnfolderBase]: For 9302/9302 co-relation queries the response was YES. [2023-10-12 17:24:34,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112852 conditions, 51686 events. 38788/51686 cut-off events. For 9302/9302 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 273950 event pairs, 14620 based on Foata normal form. 0/44430 useless extension candidates. Maximal degree in co-relation 112060. Up to 26944 conditions per place. [2023-10-12 17:24:34,520 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:34,523 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:24:34,526 INFO L430 stractBuchiCegarLoop]: Abstraction has has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:34,527 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:24:34,527 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 71 places, 101 transitions, 482 flow [2023-10-12 17:24:34,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:34,603 INFO L124 PetriNetUnfolderBase]: 1548/2141 cut-off events. [2023-10-12 17:24:34,603 INFO L125 PetriNetUnfolderBase]: For 759/759 co-relation queries the response was YES. [2023-10-12 17:24:34,603 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:34,603 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [189] L116-1-->$Ultimate##0: 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] 137#[L117, $Ultimate##0, $Ultimate##0]true [154] $Ultimate##0-->L102: Formula: (and (not v_f2_11_6) (not v_f1_10_6)) InVars {} OutVars{f2_11=v_f2_11_6, f1_10=v_f1_10_6} AuxVars[] AssignedVars[f1_10, f2_11] 139#[L117, L102, $Ultimate##0]true [204] L102-->L72: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar3_4 5) (= v_thread5Thread1of1ForFork4_thidvar4_4 5) (= v_thread5Thread1of1ForFork4_thidvar1_4 5) (= v_thread5Thread1of1ForFork4_thidvar0_4 5) (= v_thread5Thread1of1ForFork4_thidvar2_4 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_4, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_4, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_4, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_4, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_4} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4] 141#[L117, L106, $Ultimate##0, L72]true [2023-10-12 17:24:34,604 INFO L750 eck$LassoCheckResult]: Loop: 141#[L117, L106, $Ultimate##0, L72]true [161] L72-->L74: Formula: (= v_temp_12_1 v_x_8_3) InVars {x_8=v_x_8_3} OutVars{temp_12=v_temp_12_1, x_8=v_x_8_3} AuxVars[] AssignedVars[temp_12] 144#[L74, L117, L106, $Ultimate##0]true [162] L74-->L75: Formula: (= (+ v_temp_12_2 1) v_x_8_4) InVars {temp_12=v_temp_12_2} OutVars{temp_12=v_temp_12_2, x_8=v_x_8_4} AuxVars[] AssignedVars[x_8] 146#[L75, L117, L106, $Ultimate##0]true [163] L75-->L76: Formula: v_f1_10_2 InVars {} OutVars{f1_10=v_f1_10_2} AuxVars[] AssignedVars[f1_10] 148#[L76, L117, L106, $Ultimate##0]true [164] L76-->L77: Formula: v_f2_11_2 InVars {f2_11=v_f2_11_2} OutVars{f2_11=v_f2_11_2} AuxVars[] AssignedVars[] 150#[L117, L77, L106, $Ultimate##0]true [165] L77-->L78: Formula: (= v_temp_13_1 v_y_9_3) InVars {y_9=v_y_9_3} OutVars{temp_13=v_temp_13_1, y_9=v_y_9_3} AuxVars[] AssignedVars[temp_13] 152#[L117, L106, $Ultimate##0, L78]true [166] L78-->L79: Formula: (= v_y_9_4 (+ v_temp_13_2 1)) InVars {temp_13=v_temp_13_2} OutVars{temp_13=v_temp_13_2, y_9=v_y_9_4} AuxVars[] AssignedVars[y_9] 154#[L117, L79, L106, $Ultimate##0]true [167] L79-->L80: Formula: (not v_f1_10_3) InVars {} OutVars{f1_10=v_f1_10_3} AuxVars[] AssignedVars[f1_10] 156#[L80, L117, L106, $Ultimate##0]true [168] L80-->L72: Formula: (not v_f2_11_3) InVars {f2_11=v_f2_11_3} OutVars{f2_11=v_f2_11_3} AuxVars[] AssignedVars[] 141#[L117, L106, $Ultimate##0, L72]true [2023-10-12 17:24:34,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash 123938421, now seen corresponding path program 1 times [2023-10-12 17:24:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:34,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167899523] [2023-10-12 17:24:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:34,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:24:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:34,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:24:34,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2113034363, now seen corresponding path program 1 times [2023-10-12 17:24:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317309299] [2023-10-12 17:24:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:34,628 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:24:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317309299] [2023-10-12 17:24:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317309299] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:24:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031385468] [2023-10-12 17:24:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:34,630 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:24:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:24:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:24:34,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 101 transitions, 482 flow. Second operand has 3 states, 2 states have (on average 4.0) 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:24:34,630 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:34,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:37,321 INFO L124 PetriNetUnfolderBase]: 44888/60266 cut-off events. [2023-10-12 17:24:37,322 INFO L125 PetriNetUnfolderBase]: For 10174/10174 co-relation queries the response was YES. [2023-10-12 17:24:37,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191099 conditions, 60266 events. 44888/60266 cut-off events. For 10174/10174 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 322802 event pairs, 8568 based on Foata normal form. 1240/53074 useless extension candidates. Maximal degree in co-relation 189817. Up to 31424 conditions per place. [2023-10-12 17:24:37,763 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 170 selfloop transitions, 6 changer transitions 0/176 dead transitions. [2023-10-12 17:24:37,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:37,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:40,379 INFO L124 PetriNetUnfolderBase]: 44888/60266 cut-off events. [2023-10-12 17:24:40,379 INFO L125 PetriNetUnfolderBase]: For 10174/10174 co-relation queries the response was YES. [2023-10-12 17:24:40,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191099 conditions, 60266 events. 44888/60266 cut-off events. For 10174/10174 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 322897 event pairs, 8568 based on Foata normal form. 0/51834 useless extension candidates. Maximal degree in co-relation 189817. Up to 31424 conditions per place. [2023-10-12 17:24:40,504 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:40,506 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:24:40,507 INFO L430 stractBuchiCegarLoop]: Abstraction has has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:40,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:24:40,507 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 73 places, 176 transitions, 1182 flow [2023-10-12 17:24:40,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:40,602 INFO L124 PetriNetUnfolderBase]: 1548/2141 cut-off events. [2023-10-12 17:24:40,602 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2023-10-12 17:24:40,602 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:40,602 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [130] $Ultimate##0-->L59: Formula: (and (not v_f1_2_6) (not v_f2_3_6)) InVars {} OutVars{f2_3=v_f2_3_6, f1_2=v_f1_2_6} AuxVars[] AssignedVars[f2_3, f1_2] 94#[L59, L116-1]true [198] L59-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_4) (= 2 v_thread2Thread1of1ForFork0_thidvar1_4)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 96#[L29, L63, L116-1]true [201] L63-->L44: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_4) (= 3 v_thread3Thread1of1ForFork1_thidvar1_4) (= 3 v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] 170#[L29, L44, L64, L116-1]true [2023-10-12 17:24:40,603 INFO L750 eck$LassoCheckResult]: Loop: 170#[L29, L44, L64, L116-1]true [146] L44-->L46: Formula: (= v_y_1_5 v_temp_6_1) InVars {y_1=v_y_1_5} OutVars{temp_6=v_temp_6_1, y_1=v_y_1_5} AuxVars[] AssignedVars[temp_6] 173#[L29, L64, L116-1, L46]true [147] L46-->L47: Formula: (= (+ v_temp_6_2 1) v_y_1_6) InVars {temp_6=v_temp_6_2} OutVars{temp_6=v_temp_6_2, y_1=v_y_1_6} AuxVars[] AssignedVars[y_1] 175#[L29, L47, L64, L116-1]true [148] L47-->L48: Formula: v_f2_3_4 InVars {} OutVars{f2_3=v_f2_3_4} AuxVars[] AssignedVars[f2_3] 177#[L48, L29, L64, L116-1]true [149] L48-->L49: Formula: v_f1_2_4 InVars {f1_2=v_f1_2_4} OutVars{f1_2=v_f1_2_4} AuxVars[] AssignedVars[] 179#[L29, L64, L116-1, L49]true [150] L49-->L50: Formula: (= v_x_0_5 v_temp_7_1) InVars {x_0=v_x_0_5} OutVars{temp_7=v_temp_7_1, x_0=v_x_0_5} AuxVars[] AssignedVars[temp_7] 181#[L29, L64, L116-1, L50]true [151] L50-->L51: Formula: (= (+ v_temp_7_2 1) v_x_0_6) InVars {temp_7=v_temp_7_2} OutVars{temp_7=v_temp_7_2, x_0=v_x_0_6} AuxVars[] AssignedVars[x_0] 183#[L29, L51, L64, L116-1]true [152] L51-->L52: Formula: (not v_f2_3_5) InVars {} OutVars{f2_3=v_f2_3_5} AuxVars[] AssignedVars[f2_3] 185#[L29, L64, L116-1, L52]true [153] L52-->L44: Formula: (not v_f1_2_5) InVars {f1_2=v_f1_2_5} OutVars{f1_2=v_f1_2_5} AuxVars[] AssignedVars[] 170#[L29, L44, L64, L116-1]true [2023-10-12 17:24:40,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash 123883083, now seen corresponding path program 1 times [2023-10-12 17:24:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248869128] [2023-10-12 17:24:40,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:40,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:40,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:24:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:40,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:24:40,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 938176517, now seen corresponding path program 1 times [2023-10-12 17:24:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218914995] [2023-10-12 17:24:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:40,627 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:24:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218914995] [2023-10-12 17:24:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218914995] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:40,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:40,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:24:40,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658079035] [2023-10-12 17:24:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:40,628 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:24:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:40,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:24:40,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:24:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 176 transitions, 1182 flow. Second operand has 3 states, 2 states have (on average 4.0) 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:24:40,629 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:43,483 INFO L124 PetriNetUnfolderBase]: 41927/56933 cut-off events. [2023-10-12 17:24:43,484 INFO L125 PetriNetUnfolderBase]: For 10331/10331 co-relation queries the response was YES. [2023-10-12 17:24:43,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238156 conditions, 56933 events. 41927/56933 cut-off events. For 10331/10331 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 310515 event pairs, 6009 based on Foata normal form. 1612/50339 useless extension candidates. Maximal degree in co-relation 236504. Up to 31657 conditions per place. [2023-10-12 17:24:43,903 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 306 selfloop transitions, 10 changer transitions 0/316 dead transitions. [2023-10-12 17:24:43,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:43,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:46,745 INFO L124 PetriNetUnfolderBase]: 41927/56933 cut-off events. [2023-10-12 17:24:46,745 INFO L125 PetriNetUnfolderBase]: For 10331/10331 co-relation queries the response was YES. [2023-10-12 17:24:46,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238156 conditions, 56933 events. 41927/56933 cut-off events. For 10331/10331 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 310410 event pairs, 6009 based on Foata normal form. 0/48727 useless extension candidates. Maximal degree in co-relation 236504. Up to 31657 conditions per place. [2023-10-12 17:24:46,861 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:46,864 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:24:46,865 INFO L430 stractBuchiCegarLoop]: Abstraction has has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:46,865 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:24:46,865 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 places, 316 transitions, 2750 flow [2023-10-12 17:24:47,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:47,018 INFO L124 PetriNetUnfolderBase]: 2442/3337 cut-off events. [2023-10-12 17:24:47,018 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2023-10-12 17:24:47,018 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:47,019 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [189] L116-1-->$Ultimate##0: 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] 137#[L117, $Ultimate##0, $Ultimate##0]true [154] $Ultimate##0-->L102: Formula: (and (not v_f2_11_6) (not v_f1_10_6)) InVars {} OutVars{f2_11=v_f2_11_6, f1_10=v_f1_10_6} AuxVars[] AssignedVars[f1_10, f2_11] 139#[L117, L102, $Ultimate##0]true [204] L102-->L72: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar3_4 5) (= v_thread5Thread1of1ForFork4_thidvar4_4 5) (= v_thread5Thread1of1ForFork4_thidvar1_4 5) (= v_thread5Thread1of1ForFork4_thidvar0_4 5) (= v_thread5Thread1of1ForFork4_thidvar2_4 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_4, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_4, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_4, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_4, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_4} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4] 141#[L117, L106, $Ultimate##0, L72]true [207] L106-->L87: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar1_4 6) (= v_thread6Thread1of1ForFork5_thidvar2_4 6) (= v_thread6Thread1of1ForFork5_thidvar0_4 6) (= v_thread6Thread1of1ForFork5_thidvar4_4 6) (= v_thread6Thread1of1ForFork5_thidvar3_4 6) (= v_thread6Thread1of1ForFork5_thidvar5_4 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_4, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_4, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_4, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_4, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_4, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_4} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5] 200#[L87, L117, L107, $Ultimate##0, L72]true [2023-10-12 17:24:47,019 INFO L750 eck$LassoCheckResult]: Loop: 200#[L87, L117, L107, $Ultimate##0, L72]true [170] L87-->L89: Formula: (= v_temp_14_1 v_y_9_5) InVars {y_9=v_y_9_5} OutVars{y_9=v_y_9_5, temp_14=v_temp_14_1} AuxVars[] AssignedVars[temp_14] 203#[L89, L117, L107, $Ultimate##0, L72]true [171] L89-->L90: Formula: (= v_y_9_6 (+ v_temp_14_2 1)) InVars {temp_14=v_temp_14_2} OutVars{y_9=v_y_9_6, temp_14=v_temp_14_2} AuxVars[] AssignedVars[y_9] 205#[L90, L117, L107, $Ultimate##0, L72]true [172] L90-->L91: Formula: v_f2_11_5 InVars {} OutVars{f2_11=v_f2_11_5} AuxVars[] AssignedVars[f2_11] 207#[L117, L107, $Ultimate##0, L72, L91]true [173] L91-->L92: Formula: v_f1_10_4 InVars {f1_10=v_f1_10_4} OutVars{f1_10=v_f1_10_4} AuxVars[] AssignedVars[] 209#[L117, L92, L107, $Ultimate##0, L72]true [174] L92-->L93: Formula: (= v_temp_15_1 v_x_8_5) InVars {x_8=v_x_8_5} OutVars{temp_15=v_temp_15_1, x_8=v_x_8_5} AuxVars[] AssignedVars[temp_15] 211#[L93, L117, L107, $Ultimate##0, L72]true [175] L93-->L94: Formula: (= (+ v_temp_15_2 1) v_x_8_6) InVars {temp_15=v_temp_15_2} OutVars{temp_15=v_temp_15_2, x_8=v_x_8_6} AuxVars[] AssignedVars[x_8] 213#[L117, L107, L94, $Ultimate##0, L72]true [176] L94-->L95: Formula: (not v_f2_11_4) InVars {} OutVars{f2_11=v_f2_11_4} AuxVars[] AssignedVars[f2_11] 215#[L117, L107, L95, $Ultimate##0, L72]true [177] L95-->L87: Formula: (not v_f1_10_5) InVars {f1_10=v_f1_10_5} OutVars{f1_10=v_f1_10_5} AuxVars[] AssignedVars[] 200#[L87, L117, L107, $Ultimate##0, L72]true [2023-10-12 17:24:47,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -452876038, now seen corresponding path program 1 times [2023-10-12 17:24:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400882991] [2023-10-12 17:24:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:47,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:24:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:47,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:24:47,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash 351206405, now seen corresponding path program 1 times [2023-10-12 17:24:47,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:47,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736562148] [2023-10-12 17:24:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:47,042 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:24:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736562148] [2023-10-12 17:24:47,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736562148] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:24:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523447585] [2023-10-12 17:24:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:47,043 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:24:47,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:47,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:24:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:24:47,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 316 transitions, 2750 flow. Second operand has 3 states, 2 states have (on average 4.0) 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:24:47,044 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:50,016 INFO L124 PetriNetUnfolderBase]: 39083/53726 cut-off events. [2023-10-12 17:24:50,017 INFO L125 PetriNetUnfolderBase]: For 10566/10566 co-relation queries the response was YES. [2023-10-12 17:24:50,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279168 conditions, 53726 events. 39083/53726 cut-off events. For 10566/10566 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 296158 event pairs, 3693 based on Foata normal form. 1573/47313 useless extension candidates. Maximal degree in co-relation 277267. Up to 29878 conditions per place. [2023-10-12 17:24:50,448 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 544 selfloop transitions, 20 changer transitions 0/564 dead transitions. [2023-10-12 17:24:50,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:50,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:53,947 INFO L124 PetriNetUnfolderBase]: 39083/53726 cut-off events. [2023-10-12 17:24:53,947 INFO L125 PetriNetUnfolderBase]: For 10566/10566 co-relation queries the response was YES. [2023-10-12 17:24:54,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279168 conditions, 53726 events. 39083/53726 cut-off events. For 10566/10566 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 296206 event pairs, 3693 based on Foata normal form. 0/45740 useless extension candidates. Maximal degree in co-relation 277267. Up to 29878 conditions per place. [2023-10-12 17:24:54,079 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:54,084 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:24:54,085 INFO L430 stractBuchiCegarLoop]: Abstraction has has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:54,086 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:24:54,086 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 places, 564 transitions, 6030 flow [2023-10-12 17:24:55,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:55,667 INFO L124 PetriNetUnfolderBase]: 13577/18237 cut-off events. [2023-10-12 17:24:55,667 INFO L125 PetriNetUnfolderBase]: For 5212/5212 co-relation queries the response was YES. [2023-10-12 17:24:55,667 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:55,668 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [130] $Ultimate##0-->L59: Formula: (and (not v_f1_2_6) (not v_f2_3_6)) InVars {} OutVars{f2_3=v_f2_3_6, f1_2=v_f1_2_6} AuxVars[] AssignedVars[f2_3, f1_2] 94#[L59, L116-1]true [198] L59-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_4) (= 2 v_thread2Thread1of1ForFork0_thidvar1_4)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 96#[L29, L63, L116-1]true [137] L29-->L31: Formula: (= v_x_0_1 v_temp_4_1) InVars {x_0=v_x_0_1} OutVars{temp_4=v_temp_4_1, x_0=v_x_0_1} AuxVars[] AssignedVars[temp_4] 99#[L31, L63, L116-1]true [201] L63-->L44: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_4) (= 3 v_thread3Thread1of1ForFork1_thidvar1_4) (= 3 v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] 230#[L44, L31, L64, L116-1]true [138] L31-->L32: Formula: (= (+ v_temp_4_2 1) v_x_0_2) InVars {temp_4=v_temp_4_2} OutVars{temp_4=v_temp_4_2, x_0=v_x_0_2} AuxVars[] AssignedVars[x_0] 232#[L44, L64, L116-1, L32]true [146] L44-->L46: Formula: (= v_y_1_5 v_temp_6_1) InVars {y_1=v_y_1_5} OutVars{temp_6=v_temp_6_1, y_1=v_y_1_5} AuxVars[] AssignedVars[temp_6] 234#[L64, L116-1, L32, L46]true [147] L46-->L47: Formula: (= (+ v_temp_6_2 1) v_y_1_6) InVars {temp_6=v_temp_6_2} OutVars{temp_6=v_temp_6_2, y_1=v_y_1_6} AuxVars[] AssignedVars[y_1] 236#[L47, L64, L116-1, L32]true [139] L32-->L33: Formula: v_f1_2_2 InVars {} OutVars{f1_2=v_f1_2_2} AuxVars[] AssignedVars[f1_2] 238#[L33, L47, L64, L116-1]true [148] L47-->L48: Formula: v_f2_3_4 InVars {} OutVars{f2_3=v_f2_3_4} AuxVars[] AssignedVars[f2_3] 240#[L48, L33, L64, L116-1]true [149] L48-->L49: Formula: v_f1_2_4 InVars {f1_2=v_f1_2_4} OutVars{f1_2=v_f1_2_4} AuxVars[] AssignedVars[] 242#[L33, L64, L116-1, L49]true [150] L49-->L50: Formula: (= v_x_0_5 v_temp_7_1) InVars {x_0=v_x_0_5} OutVars{temp_7=v_temp_7_1, x_0=v_x_0_5} AuxVars[] AssignedVars[temp_7] 244#[L33, L64, L116-1, L50]true [151] L50-->L51: Formula: (= (+ v_temp_7_2 1) v_x_0_6) InVars {temp_7=v_temp_7_2} OutVars{temp_7=v_temp_7_2, x_0=v_x_0_6} AuxVars[] AssignedVars[x_0] 246#[L33, L51, L64, L116-1]true [152] L51-->L52: Formula: (not v_f2_3_5) InVars {} OutVars{f2_3=v_f2_3_5} AuxVars[] AssignedVars[f2_3] 248#[L33, L64, L116-1, L52]true [140] L33-->L34: Formula: v_f2_3_3 InVars {f2_3=v_f2_3_3} OutVars{f2_3=v_f2_3_3} AuxVars[] AssignedVars[] 250#[L34, L64, L116-1, L52]true [141] L34-->L35: Formula: (= v_y_1_1 v_temp_5_1) InVars {y_1=v_y_1_1} OutVars{y_1=v_y_1_1, temp_5=v_temp_5_1} AuxVars[] AssignedVars[temp_5] 252#[L35, L64, L116-1, L52]true [142] L35-->L36: Formula: (= (+ v_temp_5_2 1) v_y_1_2) InVars {temp_5=v_temp_5_2} OutVars{y_1=v_y_1_2, temp_5=v_temp_5_2} AuxVars[] AssignedVars[y_1] 254#[L64, L116-1, L52, L36]true [143] L36-->L37: Formula: (not v_f1_2_3) InVars {} OutVars{f1_2=v_f1_2_3} AuxVars[] AssignedVars[f1_2] 256#[L64, L116-1, L52, L37]true [153] L52-->L44: Formula: (not v_f1_2_5) InVars {f1_2=v_f1_2_5} OutVars{f1_2=v_f1_2_5} AuxVars[] AssignedVars[] 258#[L44, L64, L116-1, L37]true [2023-10-12 17:24:55,668 INFO L750 eck$LassoCheckResult]: Loop: 258#[L44, L64, L116-1, L37]true [146] L44-->L46: Formula: (= v_y_1_5 v_temp_6_1) InVars {y_1=v_y_1_5} OutVars{temp_6=v_temp_6_1, y_1=v_y_1_5} AuxVars[] AssignedVars[temp_6] 261#[L64, L116-1, L46, L37]true [147] L46-->L47: Formula: (= (+ v_temp_6_2 1) v_y_1_6) InVars {temp_6=v_temp_6_2} OutVars{temp_6=v_temp_6_2, y_1=v_y_1_6} AuxVars[] AssignedVars[y_1] 263#[L47, L64, L116-1, L37]true [148] L47-->L48: Formula: v_f2_3_4 InVars {} OutVars{f2_3=v_f2_3_4} AuxVars[] AssignedVars[f2_3] 265#[L48, L64, L116-1, L37]true [149] L48-->L49: Formula: v_f1_2_4 InVars {f1_2=v_f1_2_4} OutVars{f1_2=v_f1_2_4} AuxVars[] AssignedVars[] 267#[L64, L116-1, L49, L37]true [150] L49-->L50: Formula: (= v_x_0_5 v_temp_7_1) InVars {x_0=v_x_0_5} OutVars{temp_7=v_temp_7_1, x_0=v_x_0_5} AuxVars[] AssignedVars[temp_7] 269#[L64, L116-1, L50, L37]true [151] L50-->L51: Formula: (= (+ v_temp_7_2 1) v_x_0_6) InVars {temp_7=v_temp_7_2} OutVars{temp_7=v_temp_7_2, x_0=v_x_0_6} AuxVars[] AssignedVars[x_0] 271#[L51, L64, L116-1, L37]true [152] L51-->L52: Formula: (not v_f2_3_5) InVars {} OutVars{f2_3=v_f2_3_5} AuxVars[] AssignedVars[f2_3] 256#[L64, L116-1, L52, L37]true [144] L37-->L29: Formula: (not v_f2_3_2) InVars {f2_3=v_f2_3_2} OutVars{f2_3=v_f2_3_2} AuxVars[] AssignedVars[] 185#[L29, L64, L116-1, L52]true [137] L29-->L31: Formula: (= v_x_0_1 v_temp_4_1) InVars {x_0=v_x_0_1} OutVars{temp_4=v_temp_4_1, x_0=v_x_0_1} AuxVars[] AssignedVars[temp_4] 275#[L31, L64, L116-1, L52]true [138] L31-->L32: Formula: (= (+ v_temp_4_2 1) v_x_0_2) InVars {temp_4=v_temp_4_2} OutVars{temp_4=v_temp_4_2, x_0=v_x_0_2} AuxVars[] AssignedVars[x_0] 277#[L64, L116-1, L52, L32]true [139] L32-->L33: Formula: v_f1_2_2 InVars {} OutVars{f1_2=v_f1_2_2} AuxVars[] AssignedVars[f1_2] 248#[L33, L64, L116-1, L52]true [140] L33-->L34: Formula: v_f2_3_3 InVars {f2_3=v_f2_3_3} OutVars{f2_3=v_f2_3_3} AuxVars[] AssignedVars[] 250#[L34, L64, L116-1, L52]true [141] L34-->L35: Formula: (= v_y_1_1 v_temp_5_1) InVars {y_1=v_y_1_1} OutVars{y_1=v_y_1_1, temp_5=v_temp_5_1} AuxVars[] AssignedVars[temp_5] 252#[L35, L64, L116-1, L52]true [142] L35-->L36: Formula: (= (+ v_temp_5_2 1) v_y_1_2) InVars {temp_5=v_temp_5_2} OutVars{y_1=v_y_1_2, temp_5=v_temp_5_2} AuxVars[] AssignedVars[y_1] 254#[L64, L116-1, L52, L36]true [143] L36-->L37: Formula: (not v_f1_2_3) InVars {} OutVars{f1_2=v_f1_2_3} AuxVars[] AssignedVars[f1_2] 256#[L64, L116-1, L52, L37]true [153] L52-->L44: Formula: (not v_f1_2_5) InVars {f1_2=v_f1_2_5} OutVars{f1_2=v_f1_2_5} AuxVars[] AssignedVars[] 258#[L44, L64, L116-1, L37]true [2023-10-12 17:24:55,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1733904639, now seen corresponding path program 1 times [2023-10-12 17:24:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918481878] [2023-10-12 17:24:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:55,694 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:24:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:55,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918481878] [2023-10-12 17:24:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918481878] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:55,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:55,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:24:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684218907] [2023-10-12 17:24:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:55,695 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:24:55,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash -852533111, now seen corresponding path program 1 times [2023-10-12 17:24:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612736766] [2023-10-12 17:24:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:55,715 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:24:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612736766] [2023-10-12 17:24:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612736766] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:24:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:24:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:24:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369941723] [2023-10-12 17:24:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:24:55,716 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:24:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:24:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:24:55,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 564 transitions, 6030 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:24:55,717 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:55,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:58,904 INFO L124 PetriNetUnfolderBase]: 31214/42953 cut-off events. [2023-10-12 17:24:58,905 INFO L125 PetriNetUnfolderBase]: For 8950/8950 co-relation queries the response was YES. [2023-10-12 17:24:58,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266233 conditions, 42953 events. 31214/42953 cut-off events. For 8950/8950 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 230105 event pairs, 1727 based on Foata normal form. 726/36969 useless extension candidates. Maximal degree in co-relation 264336. Up to 23887 conditions per place. [2023-10-12 17:24:59,253 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 566 selfloop transitions, 20 changer transitions 0/586 dead transitions. [2023-10-12 17:24:59,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 586 transitions, 7446 flow [2023-10-12 17:24:59,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 586 transitions, 7446 flow [2023-10-12 17:25:02,343 INFO L124 PetriNetUnfolderBase]: 31214/42953 cut-off events. [2023-10-12 17:25:02,344 INFO L125 PetriNetUnfolderBase]: For 8950/8950 co-relation queries the response was YES. [2023-10-12 17:25:02,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266233 conditions, 42953 events. 31214/42953 cut-off events. For 8950/8950 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 230207 event pairs, 1727 based on Foata normal form. 0/36243 useless extension candidates. Maximal degree in co-relation 264336. Up to 23887 conditions per place. [2023-10-12 17:25:02,421 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 79 places, 586 transitions, 7446 flow [2023-10-12 17:25:02,428 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 79 places, 586 transitions, 7446 flow [2023-10-12 17:25:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:02,429 INFO L430 stractBuchiCegarLoop]: Abstraction has has 79 places, 586 transitions, 7446 flow [2023-10-12 17:25:02,429 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:25:02,429 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 places, 586 transitions, 7446 flow [2023-10-12 17:25:04,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:04,035 INFO L124 PetriNetUnfolderBase]: 12896/17432 cut-off events. [2023-10-12 17:25:04,035 INFO L125 PetriNetUnfolderBase]: For 5010/5010 co-relation queries the response was YES. [2023-10-12 17:25:04,035 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:04,037 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [189] L116-1-->$Ultimate##0: 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] 137#[L117, $Ultimate##0, $Ultimate##0]true [154] $Ultimate##0-->L102: Formula: (and (not v_f2_11_6) (not v_f1_10_6)) InVars {} OutVars{f2_11=v_f2_11_6, f1_10=v_f1_10_6} AuxVars[] AssignedVars[f1_10, f2_11] 139#[L117, L102, $Ultimate##0]true [204] L102-->L72: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar3_4 5) (= v_thread5Thread1of1ForFork4_thidvar4_4 5) (= v_thread5Thread1of1ForFork4_thidvar1_4 5) (= v_thread5Thread1of1ForFork4_thidvar0_4 5) (= v_thread5Thread1of1ForFork4_thidvar2_4 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_4, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_4, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_4, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_4, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_4} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4] 141#[L117, L106, $Ultimate##0, L72]true [207] L106-->L87: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar1_4 6) (= v_thread6Thread1of1ForFork5_thidvar2_4 6) (= v_thread6Thread1of1ForFork5_thidvar0_4 6) (= v_thread6Thread1of1ForFork5_thidvar4_4 6) (= v_thread6Thread1of1ForFork5_thidvar3_4 6) (= v_thread6Thread1of1ForFork5_thidvar5_4 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_4, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_4, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_4, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_4, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_4, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_4} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5] 200#[L87, L117, L107, $Ultimate##0, L72]true [161] L72-->L74: Formula: (= v_temp_12_1 v_x_8_3) InVars {x_8=v_x_8_3} OutVars{temp_12=v_temp_12_1, x_8=v_x_8_3} AuxVars[] AssignedVars[temp_12] 299#[L74, L87, L117, L107, $Ultimate##0]true [170] L87-->L89: Formula: (= v_temp_14_1 v_y_9_5) InVars {y_9=v_y_9_5} OutVars{y_9=v_y_9_5, temp_14=v_temp_14_1} AuxVars[] AssignedVars[temp_14] 301#[L89, L74, L117, L107, $Ultimate##0]true [162] L74-->L75: Formula: (= (+ v_temp_12_2 1) v_x_8_4) InVars {temp_12=v_temp_12_2} OutVars{temp_12=v_temp_12_2, x_8=v_x_8_4} AuxVars[] AssignedVars[x_8] 303#[L89, L75, L117, L107, $Ultimate##0]true [171] L89-->L90: Formula: (= v_y_9_6 (+ v_temp_14_2 1)) InVars {temp_14=v_temp_14_2} OutVars{y_9=v_y_9_6, temp_14=v_temp_14_2} AuxVars[] AssignedVars[y_9] 305#[L90, L75, L117, L107, $Ultimate##0]true [163] L75-->L76: Formula: v_f1_10_2 InVars {} OutVars{f1_10=v_f1_10_2} AuxVars[] AssignedVars[f1_10] 307#[L90, L76, L117, L107, $Ultimate##0]true [172] L90-->L91: Formula: v_f2_11_5 InVars {} OutVars{f2_11=v_f2_11_5} AuxVars[] AssignedVars[f2_11] 309#[L76, L117, L107, $Ultimate##0, L91]true [173] L91-->L92: Formula: v_f1_10_4 InVars {f1_10=v_f1_10_4} OutVars{f1_10=v_f1_10_4} AuxVars[] AssignedVars[] 311#[L76, L117, L92, L107, $Ultimate##0]true [174] L92-->L93: Formula: (= v_temp_15_1 v_x_8_5) InVars {x_8=v_x_8_5} OutVars{temp_15=v_temp_15_1, x_8=v_x_8_5} AuxVars[] AssignedVars[temp_15] 313#[L76, L93, L117, L107, $Ultimate##0]true [175] L93-->L94: Formula: (= (+ v_temp_15_2 1) v_x_8_6) InVars {temp_15=v_temp_15_2} OutVars{temp_15=v_temp_15_2, x_8=v_x_8_6} AuxVars[] AssignedVars[x_8] 315#[L76, L117, L94, L107, $Ultimate##0]true [176] L94-->L95: Formula: (not v_f2_11_4) InVars {} OutVars{f2_11=v_f2_11_4} AuxVars[] AssignedVars[f2_11] 317#[L76, L117, L107, L95, $Ultimate##0]true [164] L76-->L77: Formula: v_f2_11_2 InVars {f2_11=v_f2_11_2} OutVars{f2_11=v_f2_11_2} AuxVars[] AssignedVars[] 319#[L117, L77, L107, L95, $Ultimate##0]true [165] L77-->L78: Formula: (= v_temp_13_1 v_y_9_3) InVars {y_9=v_y_9_3} OutVars{temp_13=v_temp_13_1, y_9=v_y_9_3} AuxVars[] AssignedVars[temp_13] 321#[L117, L107, L95, $Ultimate##0, L78]true [166] L78-->L79: Formula: (= v_y_9_4 (+ v_temp_13_2 1)) InVars {temp_13=v_temp_13_2} OutVars{temp_13=v_temp_13_2, y_9=v_y_9_4} AuxVars[] AssignedVars[y_9] 323#[L117, L79, L107, L95, $Ultimate##0]true [167] L79-->L80: Formula: (not v_f1_10_3) InVars {} OutVars{f1_10=v_f1_10_3} AuxVars[] AssignedVars[f1_10] 325#[L80, L117, L107, L95, $Ultimate##0]true [177] L95-->L87: Formula: (not v_f1_10_5) InVars {f1_10=v_f1_10_5} OutVars{f1_10=v_f1_10_5} AuxVars[] AssignedVars[] 327#[L80, L87, L117, L107, $Ultimate##0]true [2023-10-12 17:25:04,038 INFO L750 eck$LassoCheckResult]: Loop: 327#[L80, L87, L117, L107, $Ultimate##0]true [170] L87-->L89: Formula: (= v_temp_14_1 v_y_9_5) InVars {y_9=v_y_9_5} OutVars{y_9=v_y_9_5, temp_14=v_temp_14_1} AuxVars[] AssignedVars[temp_14] 330#[L89, L80, L117, L107, $Ultimate##0]true [171] L89-->L90: Formula: (= v_y_9_6 (+ v_temp_14_2 1)) InVars {temp_14=v_temp_14_2} OutVars{y_9=v_y_9_6, temp_14=v_temp_14_2} AuxVars[] AssignedVars[y_9] 332#[L90, L80, L117, L107, $Ultimate##0]true [172] L90-->L91: Formula: v_f2_11_5 InVars {} OutVars{f2_11=v_f2_11_5} AuxVars[] AssignedVars[f2_11] 334#[L80, L117, L107, $Ultimate##0, L91]true [173] L91-->L92: Formula: v_f1_10_4 InVars {f1_10=v_f1_10_4} OutVars{f1_10=v_f1_10_4} AuxVars[] AssignedVars[] 336#[L80, L117, L92, L107, $Ultimate##0]true [174] L92-->L93: Formula: (= v_temp_15_1 v_x_8_5) InVars {x_8=v_x_8_5} OutVars{temp_15=v_temp_15_1, x_8=v_x_8_5} AuxVars[] AssignedVars[temp_15] 338#[L80, L93, L117, L107, $Ultimate##0]true [175] L93-->L94: Formula: (= (+ v_temp_15_2 1) v_x_8_6) InVars {temp_15=v_temp_15_2} OutVars{temp_15=v_temp_15_2, x_8=v_x_8_6} AuxVars[] AssignedVars[x_8] 340#[L80, L117, L94, L107, $Ultimate##0]true [176] L94-->L95: Formula: (not v_f2_11_4) InVars {} OutVars{f2_11=v_f2_11_4} AuxVars[] AssignedVars[f2_11] 325#[L80, L117, L107, L95, $Ultimate##0]true [168] L80-->L72: Formula: (not v_f2_11_3) InVars {f2_11=v_f2_11_3} OutVars{f2_11=v_f2_11_3} AuxVars[] AssignedVars[] 215#[L117, L107, L95, $Ultimate##0, L72]true [161] L72-->L74: Formula: (= v_temp_12_1 v_x_8_3) InVars {x_8=v_x_8_3} OutVars{temp_12=v_temp_12_1, x_8=v_x_8_3} AuxVars[] AssignedVars[temp_12] 344#[L74, L117, L107, L95, $Ultimate##0]true [162] L74-->L75: Formula: (= (+ v_temp_12_2 1) v_x_8_4) InVars {temp_12=v_temp_12_2} OutVars{temp_12=v_temp_12_2, x_8=v_x_8_4} AuxVars[] AssignedVars[x_8] 346#[L75, L117, L107, L95, $Ultimate##0]true [163] L75-->L76: Formula: v_f1_10_2 InVars {} OutVars{f1_10=v_f1_10_2} AuxVars[] AssignedVars[f1_10] 317#[L76, L117, L107, L95, $Ultimate##0]true [164] L76-->L77: Formula: v_f2_11_2 InVars {f2_11=v_f2_11_2} OutVars{f2_11=v_f2_11_2} AuxVars[] AssignedVars[] 319#[L117, L77, L107, L95, $Ultimate##0]true [165] L77-->L78: Formula: (= v_temp_13_1 v_y_9_3) InVars {y_9=v_y_9_3} OutVars{temp_13=v_temp_13_1, y_9=v_y_9_3} AuxVars[] AssignedVars[temp_13] 321#[L117, L107, L95, $Ultimate##0, L78]true [166] L78-->L79: Formula: (= v_y_9_4 (+ v_temp_13_2 1)) InVars {temp_13=v_temp_13_2} OutVars{temp_13=v_temp_13_2, y_9=v_y_9_4} AuxVars[] AssignedVars[y_9] 323#[L117, L79, L107, L95, $Ultimate##0]true [167] L79-->L80: Formula: (not v_f1_10_3) InVars {} OutVars{f1_10=v_f1_10_3} AuxVars[] AssignedVars[f1_10] 325#[L80, L117, L107, L95, $Ultimate##0]true [177] L95-->L87: Formula: (not v_f1_10_5) InVars {f1_10=v_f1_10_5} OutVars{f1_10=v_f1_10_5} AuxVars[] AssignedVars[] 327#[L80, L87, L117, L107, $Ultimate##0]true [2023-10-12 17:25:04,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:04,038 INFO L85 PathProgramCache]: Analyzing trace with hash 152217080, now seen corresponding path program 1 times [2023-10-12 17:25:04,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844621033] [2023-10-12 17:25:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:04,125 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:25:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844621033] [2023-10-12 17:25:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844621033] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65519670] [2023-10-12 17:25:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:04,126 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:04,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1089108105, now seen corresponding path program 1 times [2023-10-12 17:25:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807842788] [2023-10-12 17:25:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:04,146 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:25:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807842788] [2023-10-12 17:25:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807842788] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:04,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:04,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792404116] [2023-10-12 17:25:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:04,150 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:25:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:04,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 586 transitions, 7446 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:25:04,151 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:04,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:06,837 INFO L124 PetriNetUnfolderBase]: 24929/34340 cut-off events. [2023-10-12 17:25:06,837 INFO L125 PetriNetUnfolderBase]: For 7620/7620 co-relation queries the response was YES. [2023-10-12 17:25:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247280 conditions, 34340 events. 24929/34340 cut-off events. For 7620/7620 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 176825 event pairs, 1614 based on Foata normal form. 582/29296 useless extension candidates. Maximal degree in co-relation 245202. Up to 19067 conditions per place. [2023-10-12 17:25:07,154 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 559 selfloop transitions, 25 changer transitions 0/584 dead transitions. [2023-10-12 17:25:07,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:07,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:09,919 INFO L124 PetriNetUnfolderBase]: 24929/34340 cut-off events. [2023-10-12 17:25:09,920 INFO L125 PetriNetUnfolderBase]: For 7620/7620 co-relation queries the response was YES. [2023-10-12 17:25:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247280 conditions, 34340 events. 24929/34340 cut-off events. For 7620/7620 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 176877 event pairs, 1614 based on Foata normal form. 0/28714 useless extension candidates. Maximal degree in co-relation 245202. Up to 19067 conditions per place. [2023-10-12 17:25:09,981 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:09,988 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:09,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:09,988 INFO L430 stractBuchiCegarLoop]: Abstraction has has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:09,989 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:25:09,989 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 places, 584 transitions, 8602 flow [2023-10-12 17:25:11,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:11,310 INFO L124 PetriNetUnfolderBase]: 10354/14059 cut-off events. [2023-10-12 17:25:11,310 INFO L125 PetriNetUnfolderBase]: For 4275/4275 co-relation queries the response was YES. [2023-10-12 17:25:11,310 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:11,311 INFO L748 eck$LassoCheckResult]: Stem: 88#[$Ultimate##0]true [97] $Ultimate##0-->L116: Formula: (and (= v_x_0_3 v_x_8_1) (= v_y_9_1 v_y_1_3)) InVars {y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} OutVars{y_9=v_y_9_1, y_1=v_y_1_3, x_8=v_x_8_1, x_0=v_x_0_3} AuxVars[] AssignedVars[] 90#[L116]true [186] L116-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 92#[L116-1, $Ultimate##0]true [130] $Ultimate##0-->L59: Formula: (and (not v_f1_2_6) (not v_f2_3_6)) InVars {} OutVars{f2_3=v_f2_3_6, f1_2=v_f1_2_6} AuxVars[] AssignedVars[f2_3, f1_2] 94#[L59, L116-1]true [198] L59-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_4) (= 2 v_thread2Thread1of1ForFork0_thidvar1_4)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 96#[L29, L63, L116-1]true [201] L63-->L44: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_4) (= 3 v_thread3Thread1of1ForFork1_thidvar1_4) (= 3 v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] 170#[L29, L44, L64, L116-1]true [2023-10-12 17:25:11,311 INFO L750 eck$LassoCheckResult]: Loop: 170#[L29, L44, L64, L116-1]true [137] L29-->L31: Formula: (= v_x_0_1 v_temp_4_1) InVars {x_0=v_x_0_1} OutVars{temp_4=v_temp_4_1, x_0=v_x_0_1} AuxVars[] AssignedVars[temp_4] 230#[L44, L31, L64, L116-1]true [146] L44-->L46: Formula: (= v_y_1_5 v_temp_6_1) InVars {y_1=v_y_1_5} OutVars{temp_6=v_temp_6_1, y_1=v_y_1_5} AuxVars[] AssignedVars[temp_6] 369#[L31, L64, L116-1, L46]true [138] L31-->L32: Formula: (= (+ v_temp_4_2 1) v_x_0_2) InVars {temp_4=v_temp_4_2} OutVars{temp_4=v_temp_4_2, x_0=v_x_0_2} AuxVars[] AssignedVars[x_0] 234#[L64, L116-1, L32, L46]true [147] L46-->L47: Formula: (= (+ v_temp_6_2 1) v_y_1_6) InVars {temp_6=v_temp_6_2} OutVars{temp_6=v_temp_6_2, y_1=v_y_1_6} AuxVars[] AssignedVars[y_1] 236#[L47, L64, L116-1, L32]true [139] L32-->L33: Formula: v_f1_2_2 InVars {} OutVars{f1_2=v_f1_2_2} AuxVars[] AssignedVars[f1_2] 238#[L33, L47, L64, L116-1]true [148] L47-->L48: Formula: v_f2_3_4 InVars {} OutVars{f2_3=v_f2_3_4} AuxVars[] AssignedVars[f2_3] 240#[L48, L33, L64, L116-1]true [149] L48-->L49: Formula: v_f1_2_4 InVars {f1_2=v_f1_2_4} OutVars{f1_2=v_f1_2_4} AuxVars[] AssignedVars[] 242#[L33, L64, L116-1, L49]true [150] L49-->L50: Formula: (= v_x_0_5 v_temp_7_1) InVars {x_0=v_x_0_5} OutVars{temp_7=v_temp_7_1, x_0=v_x_0_5} AuxVars[] AssignedVars[temp_7] 244#[L33, L64, L116-1, L50]true [151] L50-->L51: Formula: (= (+ v_temp_7_2 1) v_x_0_6) InVars {temp_7=v_temp_7_2} OutVars{temp_7=v_temp_7_2, x_0=v_x_0_6} AuxVars[] AssignedVars[x_0] 246#[L33, L51, L64, L116-1]true [140] L33-->L34: Formula: v_f2_3_3 InVars {f2_3=v_f2_3_3} OutVars{f2_3=v_f2_3_3} AuxVars[] AssignedVars[] 378#[L34, L51, L64, L116-1]true [141] L34-->L35: Formula: (= v_y_1_1 v_temp_5_1) InVars {y_1=v_y_1_1} OutVars{y_1=v_y_1_1, temp_5=v_temp_5_1} AuxVars[] AssignedVars[temp_5] 380#[L35, L51, L64, L116-1]true [142] L35-->L36: Formula: (= (+ v_temp_5_2 1) v_y_1_2) InVars {temp_5=v_temp_5_2} OutVars{y_1=v_y_1_2, temp_5=v_temp_5_2} AuxVars[] AssignedVars[y_1] 382#[L51, L64, L116-1, L36]true [152] L51-->L52: Formula: (not v_f2_3_5) InVars {} OutVars{f2_3=v_f2_3_5} AuxVars[] AssignedVars[f2_3] 254#[L64, L116-1, L52, L36]true [143] L36-->L37: Formula: (not v_f1_2_3) InVars {} OutVars{f1_2=v_f1_2_3} AuxVars[] AssignedVars[f1_2] 256#[L64, L116-1, L52, L37]true [144] L37-->L29: Formula: (not v_f2_3_2) InVars {f2_3=v_f2_3_2} OutVars{f2_3=v_f2_3_2} AuxVars[] AssignedVars[] 185#[L29, L64, L116-1, L52]true [153] L52-->L44: Formula: (not v_f1_2_5) InVars {f1_2=v_f1_2_5} OutVars{f1_2=v_f1_2_5} AuxVars[] AssignedVars[] 170#[L29, L44, L64, L116-1]true [2023-10-12 17:25:11,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 123883083, now seen corresponding path program 2 times [2023-10-12 17:25:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233251940] [2023-10-12 17:25:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:11,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2056855155, now seen corresponding path program 2 times [2023-10-12 17:25:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923884706] [2023-10-12 17:25:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:11,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1866884931, now seen corresponding path program 1 times [2023-10-12 17:25:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720015526] [2023-10-12 17:25:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:11,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:11,411 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:11,411 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:11,411 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:11,411 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:11,411 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:25:11,411 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:11,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:11,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:11,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: barrier-loop.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:25:11,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:11,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:11,424 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:25:11,441 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:25:11,447 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:25:11,449 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:25:11,494 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:11,494 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:25:11,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:11,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:11,498 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:25:11,499 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:25:11,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:11,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:11,531 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:25:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:11,533 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:25:11,535 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:25:11,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:25:11,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:11,812 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:11,812 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {temp_4=6, temp_7=5, x_0=6} Honda state: {temp_4=6, temp_7=5, x_0=6} Generalized eigenvectors: [{temp_4=2, temp_7=2, x_0=2}, {temp_4=0, temp_7=0, x_0=0}, {temp_4=-2, temp_7=0, x_0=0}] Lambdas: [1, 14, 0] Nus: [0, 0] [2023-10-12 17:25:11,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:11,821 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:25:11,832 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:25:11,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:11,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:11,851 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:25:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:11,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:11,853 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:25:11,854 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:25:11,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:25:11,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,469 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,469 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {temp_6=2, y_1=0, temp_5=6} Honda state: {temp_6=2, y_1=0, temp_5=6} Generalized eigenvectors: [{temp_6=0, y_1=0, temp_5=-8}, {temp_6=-3, y_1=1, temp_5=2}, {temp_6=1, y_1=1, temp_5=1}] Lambdas: [0, 0, 1] Nus: [0, 1] [2023-10-12 17:25:12,473 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:25:12,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,475 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:25:12,476 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:25:12,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,494 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,494 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite f2_3 1 0)_1=0} Honda state: {v_rep(ite f2_3 1 0)_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:12,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,500 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:25:12,502 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:25:12,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,525 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,525 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite f1_2 1 0)_1=0} Honda state: {v_rep(ite f1_2 1 0)_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,529 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:25:12,586 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:12,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:12,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:12,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:12,587 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:25:12,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:12,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:12,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: barrier-loop.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:25:12,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:12,587 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:12,589 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:25:12,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:12,595 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:25:12,597 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:25:12,600 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:12,606 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:25:12,608 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:25:12,610 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:25:12,612 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:25:12,620 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:25:12,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:12,720 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:25:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,740 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:25:12,741 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:25:12,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite f2_3 1 0)_2=0} Honda state: {v_rep(ite f2_3 1 0)_2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,768 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:25:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,770 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:25:12,799 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:25:12,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,821 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork2_thidvar0=0} Honda state: {thread1Thread1of1ForFork2_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,840 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:25:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,842 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:25:12,845 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:25:12,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,852 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,852 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar0=0} Honda state: {thread3Thread1of1ForFork1_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:25:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,857 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:25:12,858 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:25:12,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,869 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:12,870 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:12,874 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:25:12,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,875 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:25:12,877 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:25:12,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:12,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:12,898 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:25:12,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:12,900 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:25:12,904 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:25:12,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:25:12,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,152 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,152 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {y_9=-8, y_1=-8, temp_6=-4, temp_5=-5} Honda state: {y_9=-8, y_1=-8, temp_6=-4, temp_5=-5} Generalized eigenvectors: [{y_9=0, y_1=2, temp_6=2, temp_5=2}, {y_9=0, y_1=0, temp_6=0, temp_5=-3}, {y_9=0, y_1=0, temp_6=-6, temp_5=-1}] Lambdas: [1, 0, 0] Nus: [0, 0] [2023-10-12 17:25:13,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:13,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,157 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:25:13,159 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:25:13,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:13,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,189 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite f1_2 1 0)_2=0} Honda state: {v_rep(ite f1_2 1 0)_2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:13,193 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:25:13,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,194 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:25:13,196 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:25:13,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:13,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,219 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:13,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:25:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,227 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:25:13,229 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:25:13,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:13,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,239 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,239 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:13,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,243 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:25:13,245 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:25:13,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:13,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,265 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:25:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,272 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:25:13,274 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:25:13,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:25:13,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,523 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,523 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {temp_4=-2, temp_7=-1, x_8=0, x_0=0} Honda state: {temp_4=-2, temp_7=-1, x_8=0, x_0=0} Generalized eigenvectors: [{temp_4=7, temp_7=7, x_8=6, x_0=7}, {temp_4=-5, temp_7=-5, x_8=-6, x_0=-5}, {temp_4=0, temp_7=0, x_8=0, x_0=0}] Lambdas: [1, 1, 4] Nus: [0, 1] [2023-10-12 17:25:13,527 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:25:13,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:13,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:13,528 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:25:13,543 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:25:13,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:25:13,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:25:13,558 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:25:13,558 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:25:13,560 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:25:13,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] [2023-10-12 17:25:13,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] [2023-10-12 17:25:13,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier5,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier7,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] [2023-10-12 17:25:13,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier9,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier10,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier11,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier12,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier13,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier14,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier15,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier16,QUANTIFIED] [2023-10-12 17:25:13,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier17,QUANTIFIED] [2023-10-12 17:25:13,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier18,QUANTIFIED] [2023-10-12 17:25:13,593 INFO L201 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:25:13 BoogieIcfgContainer [2023-10-12 17:25:13,593 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:25:13,594 INFO L158 Benchmark]: Toolchain (without parser) took 45688.23ms. Allocated memory was 200.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 151.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:25:13,594 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 200.3MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:25:13,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.41ms. Allocated memory is still 200.3MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:25:13,594 INFO L158 Benchmark]: Boogie Preprocessor took 14.03ms. Allocated memory is still 200.3MB. Free memory was 149.7MB in the beginning and 148.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:25:13,594 INFO L158 Benchmark]: RCFGBuilder took 387.72ms. Allocated memory is still 200.3MB. Free memory was 148.6MB in the beginning and 170.0MB in the end (delta: -21.4MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2023-10-12 17:25:13,595 INFO L158 Benchmark]: BuchiAutomizer took 45263.98ms. Allocated memory was 200.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 170.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:25:13,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.23ms. Allocated memory is still 200.3MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.41ms. Allocated memory is still 200.3MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.03ms. Allocated memory is still 200.3MB. Free memory was 149.7MB in the beginning and 148.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 387.72ms. Allocated memory is still 200.3MB. Free memory was 148.6MB in the beginning and 170.0MB in the end (delta: -21.4MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 45263.98ms. Allocated memory was 200.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 170.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 8602 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.1s and 7 iterations. TraceHistogramMax:0. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 37.3s. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 386 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital46 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq212 hnf91 smp100 dnf100 smp100 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 29]: Nontermination argument in form of an infinite program execution. [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier19,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier20,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier21,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier22,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier23,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier24,QUANTIFIED] [2023-10-12 17:25:13,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier25,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier26,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier27,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier28,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier29,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier30,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier31,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier32,QUANTIFIED] [2023-10-12 17:25:13,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier33,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier34,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier35,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier36,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier37,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier38,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier39,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier40,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier41,QUANTIFIED] [2023-10-12 17:25:13,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier42,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier43,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier44,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier45,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier46,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier47,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier48,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier49,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier50,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier51,QUANTIFIED] [2023-10-12 17:25:13,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier52,QUANTIFIED] [2023-10-12 17:25:13,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier53,QUANTIFIED] [2023-10-12 17:25:13,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier54,QUANTIFIED] Nontermination argument in form of an infinite execution State at position 0 is {y_1=-8, x_0=0, freshIdentifier37=0, temp_5=-5, freshIdentifier38=0, temp_6=-4, freshIdentifier39=0, temp_4=-2, (if f2_3 then 1 else 0)=0, (if f1_2 then 1 else 0)=0, freshIdentifier40=0, temp_7=-1, freshIdentifier41=0, freshIdentifier42=0, y_9=-8, x_8=0} State at position 1 is {y_1=-8, x_0=0, freshIdentifier43=3, temp_5=-5, freshIdentifier44=3, temp_6=-4, freshIdentifier45=3, temp_4=-2, (if f2_3 then 1 else 0)=0, (if f1_2 then 1 else 0)=0, freshIdentifier46=2, temp_7=-1, freshIdentifier47=1, freshIdentifier48=2, y_9=-8, x_8=0} For i>1, the state at position i is {y_1=-8 + sum_{k=0}^i 2, x_0=0 + sum_{k=0}^i 7 + -5, freshIdentifier49=3 + sum_{k=0}^i 0, temp_5=-5 + sum_{k=0}^i 2 + -3*0^k + -1*0^k, freshIdentifier50=3 + sum_{k=0}^i 0, temp_6=-4 + sum_{k=0}^i 2 + -6*0^k, freshIdentifier51=3 + sum_{k=0}^i 0, temp_4=-2 + sum_{k=0}^i 7 + -5, (if f2_3 then 1 else 0)=0 + sum_{k=0}^i 0, (if f1_2 then 1 else 0)=0 + sum_{k=0}^i 0, freshIdentifier52=2 + sum_{k=0}^i 0, temp_7=-1 + sum_{k=0}^i 7 + -5, freshIdentifier53=1 + sum_{k=0}^i 0, freshIdentifier54=2 + sum_{k=0}^i 0, y_9=-8 + sum_{k=0}^i 0, x_8=0 + sum_{k=0}^i 6 + -6} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [1, 0, 0, 1, 1, 4] Mus: [0, 0, 0, 0, 1] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L115] 0 assume x_0 == x_8 && y_1 == y_9; [L116] FORK 0 fork 1 thread1(); [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; [L63] FORK 1 fork 2, 2 thread2(); [L64] FORK 1 fork 3, 3, 3 thread3(); Loop: [L30] temp_4 := x_0; [L45] temp_6 := y_1; [L31] x_0 := temp_4 + 1; [L46] y_1 := temp_6 + 1; [L32] f1_2 := true; [L47] f2_3 := true; [L48] assume f1_2; [L49] temp_7 := x_0; [L50] x_0 := temp_7 + 1; [L33] assume f2_3; [L34] temp_5 := y_1; [L35] y_1 := temp_5 + 1; [L51] f2_3 := false; [L36] f1_2 := false; [L37] assume !f2_3; [L52] assume !f1_2; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 70 PlacesAfterwards, 61 TransitionsBefore, 59 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 7686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4869, independent: 4701, independent conditional: 0, independent unconditional: 4701, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1303, independent: 1271, independent conditional: 0, independent unconditional: 1271, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1303, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4869, independent: 3430, independent conditional: 0, independent unconditional: 3430, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1303, unknown conditional: 0, unknown unconditional: 1303] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1271, Positive conditional cache size: 0, Positive unconditional cache size: 1271, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:25:13,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...