/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:25,385 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:25,431 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:41:25,467 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:25,468 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:25,468 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:25,469 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:25,470 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:25,470 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:25,474 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:25,474 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:25,474 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:25,474 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:25,476 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:25,476 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:25,477 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:25,477 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:25,477 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:25,477 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:25,477 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:25,478 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:25,478 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:25,479 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:25,479 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:25,479 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:25,480 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:25,480 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:25,480 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:25,480 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:25,480 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:25,481 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:25,482 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:25,482 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:25,483 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:25,483 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:41:25,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:25,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:25,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:25,723 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:25,724 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:25,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl [2023-10-12 17:41:25,726 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl' [2023-10-12 17:41:25,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:25,745 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:25,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:25,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:25,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:25,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,769 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:25,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:25,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:25,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:25,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:25,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:25,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:25,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:25,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:25,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:25,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:25,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:41:25,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:25,867 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:25,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:25,867 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:25,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:25,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:25,869 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:41:25,906 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:25,908 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:25,990 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:26,006 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:26,006 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:26,008 INFO L201 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:26 BoogieIcfgContainer [2023-10-12 17:41:26,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:26,009 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:26,009 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:26,013 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:26,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:26,014 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/2) ... [2023-10-12 17:41:26,015 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a1e8307 and model type figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:26, skipping insertion in model container [2023-10-12 17:41:26,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:26,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:26" (2/2) ... [2023-10-12 17:41:26,017 INFO L332 chiAutomizerObserver]: Analyzing ICFG figure1.wvr.bpl [2023-10-12 17:41:26,063 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:41:26,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:41:26,111 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:41:26,111 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:26,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:41:26,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:41:26,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:26,122 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:26,134 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:26,136 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:26,143 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:41:26,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:26,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:41:26,145 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:41:26,325 INFO L134 LiptonReduction]: Checked pairs total: 37 [2023-10-12 17:41:26,325 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:41:26,337 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:26,338 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:26,338 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:26,338 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:26,338 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:26,338 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:26,338 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:26,338 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:26,339 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:26,342 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][9], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][7]] [2023-10-12 17:41:26,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:26,344 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:26,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:26,344 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:26,347 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:26,347 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:26,348 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][9], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][7]] [2023-10-12 17:41:26,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:26,349 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:26,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:26,349 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:26,354 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L19-1, L45-1]true [2023-10-12 17:41:26,354 INFO L750 eck$LassoCheckResult]: Loop: 35#[L19-1, L45-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 35#[L19-1, L45-1]true [2023-10-12 17:41:26,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 3410, now seen corresponding path program 1 times [2023-10-12 17:41:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067233456] [2023-10-12 17:41:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2023-10-12 17:41:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099970490] [2023-10-12 17:41:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 105779, now seen corresponding path program 1 times [2023-10-12 17:41:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291335927] [2023-10-12 17:41:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,584 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,585 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,585 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:26,585 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,585 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,585 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:26,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,586 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,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:41:26,609 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:26,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,649 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:41:26,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:26,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:26,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:41:26,748 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:41:26,748 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [{counter=1}, {counter=-2}, {counter=2}] Lambdas: [1, 2, 1] Nus: [0, 1] [2023-10-12 17:41:26,754 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:41:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:41:26,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:26,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:41:26,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:26,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,901 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:26,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,906 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:26,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:26,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,907 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:26,937 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:26,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,985 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:26,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:27,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:41:27,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,031 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:41:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:41:27,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:27,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:27,067 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:27,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:41:27,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,074 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:27,075 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,075 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2023-10-12 17:41:27,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,086 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:27,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,146 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:27,173 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:41:27,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:41:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:41:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,267 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:27,267 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:41:27,268 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:27,269 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][36], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][8], 4:3A:[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][15]][5:4A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][17]] [2023-10-12 17:41:27,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:27,269 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:41:27,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:27,269 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:27,270 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L19-1, L45-1]true [65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:27,270 INFO L750 eck$LassoCheckResult]: Loop: 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:27,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 105775, now seen corresponding path program 1 times [2023-10-12 17:41:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206820314] [2023-10-12 17:41:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2023-10-12 17:41:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330793143] [2023-10-12 17:41:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 3279097, now seen corresponding path program 1 times [2023-10-12 17:41:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936179554] [2023-10-12 17:41:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:27,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936179554] [2023-10-12 17:41:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936179554] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:27,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:41:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690581383] [2023-10-12 17:41:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:27,367 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,367 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:27,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:27,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,374 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,401 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,402 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,403 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:27,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:41:27,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:41:27,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:41:27,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:27,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,455 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:27,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,460 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:27,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,461 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:27,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,461 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,475 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,510 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,510 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:27,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:27,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:41:27,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:27,543 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,598 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:27,599 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,599 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:27,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:41:27,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,603 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:27,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,636 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:27,640 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:41:27,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:27,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:27,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:41:27,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:41:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:41:27,726 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 25 places, 220 transitions, 1560 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,726 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:27,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:27,776 INFO L124 PetriNetUnfolderBase]: 28/62 cut-off events. [2023-10-12 17:41:27,776 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-10-12 17:41:27,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 62 events. 28/62 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 142 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 164. Up to 50 conditions per place. [2023-10-12 17:41:27,780 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 39 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-10-12 17:41:27,780 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:41:27,782 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:27,783 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:41:27,783 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:27,795 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][0], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 6:3A:[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][4], 14:4A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][10], 33:5A:[68] L19-1-->thread1EXIT: Formula: (<= v_N1_4 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_4} OutVars{i1=v_i1_10, N1=v_N1_4} AuxVars[] AssignedVars[][20]][34:6A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][33]] [2023-10-12 17:41:27,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:27,796 INFO L124 PetriNetUnfolderBase]: 15/33 cut-off events. [2023-10-12 17:41:27,796 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-10-12 17:41:27,796 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:27,797 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L19-1, L45-1]true [65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 70#[L19-1, L46, L30-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 70#[L19-1, L46, L30-1]true [68] L19-1-->thread1EXIT: Formula: (<= v_N1_4 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_4} OutVars{i1=v_i1_10, N1=v_N1_4} AuxVars[] AssignedVars[] 107#[L46, L30-1, thread1EXIT]true [2023-10-12 17:41:27,797 INFO L750 eck$LassoCheckResult]: Loop: 107#[L46, L30-1, thread1EXIT]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 107#[L46, L30-1, thread1EXIT]true [2023-10-12 17:41:27,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 101651982, now seen corresponding path program 1 times [2023-10-12 17:41:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108845634] [2023-10-12 17:41:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 2 times [2023-10-12 17:41:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517333905] [2023-10-12 17:41:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1143755782, now seen corresponding path program 1 times [2023-10-12 17:41:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436074339] [2023-10-12 17:41:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,884 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,885 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:27,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:27,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,885 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,917 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,918 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:27,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,919 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:27,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:41:27,955 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:41:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:27,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:41:28,085 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:28,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,089 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:28,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:28,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:28,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:28,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:28,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:28,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:28,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:28,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:28,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:28,091 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,099 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,130 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:28,131 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:28,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:28,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:28,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:28,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:28,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:28,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:28,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:28,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:28,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:41:28,169 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:28,173 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:28,173 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:28,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,176 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:41:28,178 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:28,178 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:28,178 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:28,178 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2023-10-12 17:41:28,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:28,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,220 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:28,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:41:28,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:28,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:28,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:28,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,282 INFO L430 stractBuchiCegarLoop]: Abstraction has has 28 places, 172 transitions, 1876 flow [2023-10-12 17:41:28,283 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:41:28,283 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 172 transitions, 1876 flow [2023-10-12 17:41:28,297 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][2], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 6:3A:[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][18], 13:4A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][42], 34:5A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][90]][35:6A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][134]] [2023-10-12 17:41:28,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:28,297 INFO L124 PetriNetUnfolderBase]: 14/34 cut-off events. [2023-10-12 17:41:28,297 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:41:28,298 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:28,298 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L19-1, L45-1]true [65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 70#[L19-1, L46, L30-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:28,298 INFO L750 eck$LassoCheckResult]: Loop: 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:28,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 101651986, now seen corresponding path program 1 times [2023-10-12 17:41:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321384142] [2023-10-12 17:41:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:28,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 3 times [2023-10-12 17:41:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091063226] [2023-10-12 17:41:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:28,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1143755658, now seen corresponding path program 2 times [2023-10-12 17:41:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334370910] [2023-10-12 17:41:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334370910] [2023-10-12 17:41:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334370910] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:41:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409666687] [2023-10-12 17:41:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:28,393 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:28,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:28,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:28,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:28,394 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:28,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:28,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:28,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:28,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:28,394 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:28,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,425 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:28,425 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:28,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,427 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:28,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:28,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:41:28,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:41:28,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:28,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:28,497 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:28,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,504 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:28,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:28,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:28,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:28,504 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:28,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:28,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:28,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:28,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:28,505 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:28,506 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,512 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,541 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:28,541 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,542 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:41:28,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:28,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:28,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:28,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:28,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:28,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:28,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:28,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:28,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:28,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:28,581 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:28,587 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:28,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:41:28,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:28,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:28,592 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:28,592 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:28,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,600 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:28,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,638 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:28,639 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:41:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:28,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:28,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:28,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:28,704 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 33 places, 860 transitions, 11100 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:28,704 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:28,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:41:28,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:41:28,854 INFO L124 PetriNetUnfolderBase]: 88/221 cut-off events. [2023-10-12 17:41:28,855 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-10-12 17:41:28,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 221 events. 88/221 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1020 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 873. Up to 205 conditions per place. [2023-10-12 17:41:28,860 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 162 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2023-10-12 17:41:28,860 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:41:28,863 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:28,863 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:41:28,863 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:28,891 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][0], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][3], 7:4A:[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][6], 21:5A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][15], 47:6A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][35], 91:7A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][66], 140:8A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][108]][143:9A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][149]] [2023-10-12 17:41:28,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:28,893 INFO L124 PetriNetUnfolderBase]: 62/142 cut-off events. [2023-10-12 17:41:28,893 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:41:28,893 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:28,894 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L19-1, L45-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 35#[L19-1, L45-1]true [65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 70#[L19-1, L46, L30-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:28,894 INFO L750 eck$LassoCheckResult]: Loop: 70#[L19-1, L46, L30-1]true [72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 70#[L19-1, L46, L30-1]true [2023-10-12 17:41:28,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 473175796, now seen corresponding path program 3 times [2023-10-12 17:41:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229420027] [2023-10-12 17:41:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:28,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 4 times [2023-10-12 17:41:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845904135] [2023-10-12 17:41:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:28,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1783547860, now seen corresponding path program 4 times [2023-10-12 17:41:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966252475] [2023-10-12 17:41:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:28,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:28,981 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:28,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:28,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:28,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:28,982 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:28,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:28,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:28,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:28,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:28,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:28,982 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:28,982 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:28,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:29,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:29,013 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:29,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:29,032 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:29,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:41:29,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:29,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:29,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:29,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:29,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:29,048 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:29,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:41:29,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:29,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:29,081 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:29,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:29,088 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:29,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:29,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:29,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:29,088 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:29,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:29,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:29,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:29,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:29,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:29,088 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:29,089 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:29,100 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:29,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:29,125 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:29,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:29,130 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:41:29,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:41:29,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:29,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:29,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:29,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:29,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:29,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:29,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:29,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:29,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:29,148 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:29,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:29,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:29,149 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:29,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:41:29,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:29,153 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:29,153 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:29,153 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:29,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:41:29,160 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:29,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,199 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:29,200 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:41:29,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:29,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:29,257 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:41:29,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,293 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:29,294 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:41:29,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:29,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:29,332 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:41:29,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:29,368 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:29,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:29,369 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:29,370 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:29,430 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 190 transitions. [2023-10-12 17:41:29,431 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:41:29,449 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:41:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2023-10-12 17:41:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:41:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:29,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:29,453 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 2036 transitions, 34376 flow [2023-10-12 17:41:29,453 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:41:29,453 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 2036 transitions, 34376 flow [2023-10-12 17:41:29,581 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L45: Formula: (and (= v_counter_34 0) (= v_i1_18 0) (= v_i2_22 0) (= v_N2_10 v_N1_10)) InVars {counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_34, i1=v_i1_18, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][0], 2:2A:[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13], 4:3A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][36], 7:4A:[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][69], 21:5A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][176], 53:6A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][423], 133:7A:[69] L19-1-->L19-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][821], 245:8A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][1156]][248:9A:[72] L30-1-->L30-1: Formula: (and (= v_i2_18 (+ v_i2_19 1)) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_19 v_N2_8)) InVars {counter=v_counter_25, i2=v_i2_19, N2=v_N2_8} OutVars{counter=v_counter_24, i2=v_i2_18, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2][1595]] [2023-10-12 17:41:29,682 INFO L124 PetriNetUnfolderBase]: 175/437 cut-off events. [2023-10-12 17:41:29,683 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-10-12 17:41:29,683 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:41:29,689 INFO L201 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:41:29 BoogieIcfgContainer [2023-10-12 17:41:29,690 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:41:29,690 INFO L158 Benchmark]: Toolchain (without parser) took 3944.79ms. Allocated memory was 212.9MB in the beginning and 339.7MB in the end (delta: 126.9MB). Free memory was 164.7MB in the beginning and 165.1MB in the end (delta: -417.6kB). Peak memory consumption was 128.9MB. Max. memory is 8.0GB. [2023-10-12 17:41:29,691 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 212.9MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:29,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.39ms. Allocated memory is still 212.9MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:41:29,692 INFO L158 Benchmark]: Boogie Preprocessor took 19.28ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 162.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:29,692 INFO L158 Benchmark]: RCFGBuilder took 215.83ms. Allocated memory is still 212.9MB. Free memory was 162.0MB in the beginning and 152.7MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:41:29,692 INFO L158 Benchmark]: BuchiAutomizer took 3680.63ms. Allocated memory was 212.9MB in the beginning and 339.7MB in the end (delta: 126.9MB). Free memory was 152.5MB in the beginning and 165.1MB in the end (delta: -12.6MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2023-10-12 17:41:29,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 212.9MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.39ms. Allocated memory is still 212.9MB. Free memory was 164.7MB in the beginning and 163.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.28ms. Allocated memory is still 212.9MB. Free memory was 163.2MB in the beginning and 162.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.83ms. Allocated memory is still 212.9MB. Free memory was 162.0MB in the beginning and 152.7MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3680.63ms. Allocated memory was 212.9MB in the beginning and 339.7MB in the end (delta: 126.9MB). Free memory was 152.5MB in the beginning and 165.1MB in the end (delta: -12.6MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One nondeterministic module has affine ranking function counter and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 220 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 16 PlacesAfterwards, 20 TransitionsBefore, 11 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:41:29,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:29,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...