/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:23:46,468 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:23:46,545 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:23:46,575 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:23:46,576 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:23:46,576 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:23:46,577 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:23:46,578 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:23:46,578 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:23:46,582 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:23:46,582 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:23:46,582 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:23:46,583 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:23:46,584 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:23:46,584 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:23:46,584 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:23:46,584 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:23:46,585 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:23:46,585 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:23:46,585 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:23:46,585 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:23:46,586 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:23:46,587 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:23:46,587 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:23:46,587 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:23:46,588 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:23:46,588 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:23:46,588 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:23:46,590 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:23:46,590 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:23:46,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:23:46,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:23:46,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:23:46,870 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:23:46,870 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:23:46,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl [2023-10-12 17:23:46,872 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl' [2023-10-12 17:23:46,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:23:46,899 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:23:46,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:46,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:23:46,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:23:46,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,939 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:23:46,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:46,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:23:46,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:23:46,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:23:46,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:23:46,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:23:46,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:23:46,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:23:46,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/1) ... [2023-10-12 17:23:46,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:46,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:47,024 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:23:47,029 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:23:47,060 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:23:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:23:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:23:47,061 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:23:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:23:47,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:23:47,062 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:23:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:23:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:23:47,063 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:23:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:23:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:23:47,065 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:23:47,117 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:23:47,119 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:23:47,298 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:23:47,401 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:23:47,402 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:23:47,404 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:23:47 BoogieIcfgContainer [2023-10-12 17:23:47,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:23:47,405 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:23:47,405 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:23:47,408 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:23:47,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:47,409 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:46" (1/2) ... [2023-10-12 17:23:47,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24575a3a and model type nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:23:47, skipping insertion in model container [2023-10-12 17:23:47,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:47,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:23:47" (2/2) ... [2023-10-12 17:23:47,412 INFO L332 chiAutomizerObserver]: Analyzing ICFG nzb-file-trans.wvr.bpl [2023-10-12 17:23:47,465 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:23:47,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:23:47,509 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:23:47,510 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:47,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:23:47,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:23:47,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:23:47,520 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:23:47,533 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:23:47,536 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:23:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:23:47,543 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:23:47,543 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:47,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:23:47,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:23:47,798 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:23:47,798 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:23:47,811 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:23:47,812 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:23:47,812 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:23:47,812 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:23:47,812 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:23:47,812 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:23:47,813 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:23:47,813 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:23:47,814 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:23:47,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:47,819 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:23:47,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:47,821 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:47,825 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:23:47,825 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:23:47,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:47,827 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:23:47,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:47,827 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:47,831 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14] 40#[L41, L136]true [2023-10-12 17:23:47,832 INFO L750 eck$LassoCheckResult]: Loop: 40#[L41, L136]true [144] L41-->L41: Formula: (let ((.cse2 (not v_break_14_55)) (.cse8 (select v_ends_with_6_31 v_i_13_35)) (.cse3 (not v_break_14_56)) (.cse9 (select v_ends_with_2_31 v_i_13_35))) (let ((.cse1 (not .cse9)) (.cse5 (not v_break_14_46)) (.cse0 (and .cse9 .cse3)) (.cse4 (and .cse9 .cse8)) (.cse7 (and .cse2 .cse8)) (.cse6 (not .cse8))) (and (or (and (or v_break_14_56 .cse0) v_break_14_55) (and (or v_break_14_56 .cse1) .cse2 .cse3)) (or (and (or v_break_14_46 .cse4) v_break_14_56) (and .cse5 (or .cse6 .cse1) .cse3)) .cse5 (< v_i_13_35 5) (= (+ v_i_13_35 1) v_i_13_34) (= v_result_12_39 (ite .cse7 (+ 1000 v_i_13_35) (ite .cse0 (+ v_i_13_35 (- 1000)) (ite .cse4 0 v_result_12_41)))) (or (and (or .cse7 v_break_14_55) v_break_14_43) (and (not v_break_14_43) .cse2 (or .cse6 v_break_14_55)))))) InVars {result_12=v_result_12_41, i_13=v_i_13_35, ends_with_6=v_ends_with_6_31, break_14=v_break_14_46, ends_with_2=v_ends_with_2_31} OutVars{result_12=v_result_12_39, i_13=v_i_13_34, ends_with_6=v_ends_with_6_31, break_14=v_break_14_43, ends_with_2=v_ends_with_2_31} AuxVars[v_break_14_55, v_break_14_56] AssignedVars[result_12, i_13, break_14] 40#[L41, L136]true [2023-10-12 17:23:47,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2023-10-12 17:23:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:47,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110368826] [2023-10-12 17:23:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:47,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:47,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:47,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:23:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836199339] [2023-10-12 17:23:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:47,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:48,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:48,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2023-10-12 17:23:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610004441] [2023-10-12 17:23:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:48,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:48,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:48,645 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:48,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:48,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:48,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:48,646 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:48,646 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:48,646 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:48,646 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:48,647 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:23:48,647 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:48,647 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:48,668 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:23:48,870 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:23:48,875 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:23:48,878 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:23:48,992 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:23:49,208 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:49,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:49,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:49,217 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:23:49,220 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:23:49,220 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:23:49,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:49,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:49,228 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:23:49,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:49,296 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:23:49,297 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:23:49,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:49,470 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:23:49,470 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:23:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:49,473 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:23:49,475 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:23:49,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:49,489 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:23:49,490 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:49,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2023-10-12 17:23:49,496 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2023-10-12 17:23:49,501 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:23:49,503 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:23:49,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:49,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:49,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:49,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:23:49,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:49,560 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:23:49,595 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:23:49,596 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:49,709 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 270 transitions. [2023-10-12 17:23:49,710 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:49,714 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:49,715 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:23:49,720 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:23:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:23:49,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:23:49,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:49,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:23:49,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:49,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:23:49,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 268 transitions, 1324 flow [2023-10-12 17:23:49,853 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:23:49,873 INFO L124 PetriNetUnfolderBase]: 581/796 cut-off events. [2023-10-12 17:23:49,874 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-10-12 17:23:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 796 events. 581/796 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2591 event pairs, 7 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 1265. Up to 203 conditions per place. [2023-10-12 17:23:49,876 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 36 places, 268 transitions, 1324 flow [2023-10-12 17:23:49,880 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 36 places, 268 transitions, 1324 flow [2023-10-12 17:23:49,880 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 268 transitions, 1324 flow [2023-10-12 17:23:49,880 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:23:49,881 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 268 transitions, 1324 flow [2023-10-12 17:23:49,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:49,889 INFO L124 PetriNetUnfolderBase]: 52/78 cut-off events. [2023-10-12 17:23:49,889 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:23:49,889 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:49,890 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14] 40#[L41, L136]true [160] L136-->$Ultimate##0: 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] 87#[L41, $Ultimate##0, L137]true [146] $Ultimate##0-->L75: Formula: (and (= v_i_16_26 0) (not v_is_null_5_11) (not v_break_17_39) (not v_is_null_9_17)) InVars {is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_17} OutVars{break_17=v_break_17_39, is_null_5=v_is_null_5_11, i_16=v_i_16_26, is_null_9=v_is_null_9_17} AuxVars[] AssignedVars[i_16, break_17] 89#[L41, L75, L137]true [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17] 89#[L41, L75, L137]true [2023-10-12 17:23:49,890 INFO L750 eck$LassoCheckResult]: Loop: 89#[L41, L75, L137]true [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17] 89#[L41, L75, L137]true [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17] 89#[L41, L75, L137]true [2023-10-12 17:23:49,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 177980914, now seen corresponding path program 1 times [2023-10-12 17:23:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:49,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910323298] [2023-10-12 17:23:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:49,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 5729, now seen corresponding path program 1 times [2023-10-12 17:23:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441909072] [2023-10-12 17:23:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:49,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash -759028718, now seen corresponding path program 2 times [2023-10-12 17:23:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16861546] [2023-10-12 17:23:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:49,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:50,982 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:50,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:50,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:50,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:50,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:50,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:50,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:50,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:50,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:23:50,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:50,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:50,992 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:23:50,996 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:23:50,998 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:23:51,247 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:23:51,249 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:23:51,252 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:23:51,255 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:23:51,258 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:23:51,261 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:23:51,401 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:23:51,403 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:23:51,750 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:51,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:51,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:51,752 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:23:51,766 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:23:51,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:51,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:51,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:51,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:51,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:51,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:51,779 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:23:51,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:51,799 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:23:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:51,801 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:23:51,803 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:23:51,805 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:23:51,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:51,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:51,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:51,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:51,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:51,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:51,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:51,831 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:23:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:51,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:51,833 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:23:51,844 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:23:51,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:51,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:23:51,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:51,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:51,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:51,852 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:23:51,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:23:51,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:23:51,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:51,871 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:23:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:51,873 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:23:51,884 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:23:51,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:51,892 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-10-12 17:23:51,892 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:23:51,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:51,911 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:23:51,952 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-10-12 17:23:51,952 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:23:52,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:52,192 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2023-10-12 17:23:52,192 INFO L444 ModelExtractionUtils]: 56 out of 73 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-10-12 17:23:52,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:52,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:52,202 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:23:52,204 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:23:52,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:52,245 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:23:52,245 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:52,246 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -1*i_16 + 4 Supporting invariants [] [2023-10-12 17:23:52,253 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:23:52,257 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:23:52,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:52,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:52,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:52,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:23:52,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:52,319 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:23:52,320 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:23:52,320 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:52,448 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 270 transitions. [2023-10-12 17:23:52,448 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:52,469 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:52,470 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:23:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:23:52,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:23:52,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:52,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:23:52,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:52,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:23:52,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:52,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 3600 transitions, 25128 flow [2023-10-12 17:23:52,873 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:23:52,901 INFO L124 PetriNetUnfolderBase]: 2015/2746 cut-off events. [2023-10-12 17:23:52,901 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2023-10-12 17:23:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8788 conditions, 2746 events. 2015/2746 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11077 event pairs, 8 based on Foata normal form. 0/1398 useless extension candidates. Maximal degree in co-relation 6733. Up to 743 conditions per place. [2023-10-12 17:23:52,907 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 48 places, 3600 transitions, 25128 flow [2023-10-12 17:23:52,950 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 48 places, 3600 transitions, 25128 flow [2023-10-12 17:23:52,950 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 3600 transitions, 25128 flow [2023-10-12 17:23:52,950 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:23:52,950 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 3600 transitions, 25128 flow [2023-10-12 17:23:52,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:52,989 INFO L124 PetriNetUnfolderBase]: 188/252 cut-off events. [2023-10-12 17:23:52,989 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:23:52,989 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:52,990 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [160] L136-->$Ultimate##0: 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] 149#[$Ultimate##0, L137, $Ultimate##0]true [163] L137-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 151#[$Ultimate##0, $Ultimate##0, L138, $Ultimate##0]true [141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14] 153#[L41, $Ultimate##0, L138, $Ultimate##0]true [151] $Ultimate##0-->L109: Formula: (and (= v_i_19_14 0) (not v_break_20_13) (not v_is_null_1_11) (not v_is_null_9_11)) InVars {is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} OutVars{break_20=v_break_20_13, i_19=v_i_19_14, is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} AuxVars[] AssignedVars[break_20, i_19] 155#[L41, $Ultimate##0, L138, L109]true [154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 155#[L41, $Ultimate##0, L138, L109]true [2023-10-12 17:23:52,991 INFO L750 eck$LassoCheckResult]: Loop: 155#[L41, $Ultimate##0, L138, L109]true [154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 155#[L41, $Ultimate##0, L138, L109]true [154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 155#[L41, $Ultimate##0, L138, L109]true [2023-10-12 17:23:52,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1240072721, now seen corresponding path program 1 times [2023-10-12 17:23:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663277807] [2023-10-12 17:23:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:53,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash 5889, now seen corresponding path program 1 times [2023-10-12 17:23:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:53,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807108083] [2023-10-12 17:23:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:53,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2003948817, now seen corresponding path program 2 times [2023-10-12 17:23:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:53,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751439083] [2023-10-12 17:23:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:53,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:53,959 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:53,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:53,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:53,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:53,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:53,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:53,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:53,960 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:53,960 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:23:53,960 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:53,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:53,967 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:23:53,969 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:23:53,971 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:23:54,205 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:23:54,207 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:23:54,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:54,212 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:23:54,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:54,216 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:23:54,218 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:23:54,221 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:23:54,223 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:23:54,354 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2023-10-12 17:23:54,358 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:23:54,679 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:54,679 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:54,682 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:23:54,683 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:23:54,685 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:23:54,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:54,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:54,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:54,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:54,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:54,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:54,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:54,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:23:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:54,701 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:23:54,703 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:23:54,704 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:23:54,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:54,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:54,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:54,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:54,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:54,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:54,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:54,718 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:23:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:54,719 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:23:54,721 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:23:54,723 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:23:54,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:54,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:23:54,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:54,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:54,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:54,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:23:54,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:23:54,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:54,733 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:23:54,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:54,735 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:23:54,736 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:23:54,739 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:23:54,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:54,745 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-10-12 17:23:54,745 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:23:54,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:54,807 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-10-12 17:23:54,808 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:23:54,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:54,996 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-10-12 17:23:54,997 INFO L444 ModelExtractionUtils]: 61 out of 73 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:23:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:55,004 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:23:55,006 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:23:55,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:55,018 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:23:55,018 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:55,018 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -1*i_19 + 4 Supporting invariants [] [2023-10-12 17:23:55,025 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:23:55,030 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:23:55,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:55,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:55,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:55,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:23:55,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:55,078 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:23:55,079 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:23:55,079 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:55,157 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 270 transitions. [2023-10-12 17:23:55,157 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:55,263 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:23:55,476 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:55,476 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:23:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:23:55,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:23:55,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:55,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:23:55,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:55,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:23:55,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:55,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48432 transitions, 436848 flow [2023-10-12 17:24:07,604 INFO L124 PetriNetUnfolderBase]: 6113/8437 cut-off events. [2023-10-12 17:24:07,605 INFO L125 PetriNetUnfolderBase]: For 1978/1978 co-relation queries the response was YES. [2023-10-12 17:24:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35127 conditions, 8437 events. 6113/8437 cut-off events. For 1978/1978 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 41907 event pairs, 13 based on Foata normal form. 0/4243 useless extension candidates. Maximal degree in co-relation 26578. Up to 2311 conditions per place. [2023-10-12 17:24:07,615 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 48432 transitions, 436848 flow [2023-10-12 17:24:08,035 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 48432 transitions, 436848 flow [2023-10-12 17:24:08,035 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 48432 transitions, 436848 flow [2023-10-12 17:24:08,035 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:24:08,035 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 48432 transitions, 436848 flow [2023-10-12 17:24:21,724 INFO L124 PetriNetUnfolderBase]: 6113/8437 cut-off events. [2023-10-12 17:24:21,724 INFO L125 PetriNetUnfolderBase]: For 1978/1978 co-relation queries the response was YES. [2023-10-12 17:24:21,724 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:24:21,729 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:24:21 BoogieIcfgContainer [2023-10-12 17:24:21,729 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:24:21,730 INFO L158 Benchmark]: Toolchain (without parser) took 34830.19ms. Allocated memory was 191.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 146.1MB in the beginning and 502.1MB in the end (delta: -356.0MB). Peak memory consumption was 956.5MB. Max. memory is 8.0GB. [2023-10-12 17:24:21,730 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 191.9MB. Free memory was 147.6MB in the beginning and 147.4MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:24:21,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.73ms. Allocated memory is still 191.9MB. Free memory was 146.1MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:24:21,731 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 191.9MB. Free memory was 144.5MB in the beginning and 143.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:24:21,731 INFO L158 Benchmark]: RCFGBuilder took 421.30ms. Allocated memory was 191.9MB in the beginning and 324.0MB in the end (delta: 132.1MB). Free memory was 143.1MB in the beginning and 294.8MB in the end (delta: -151.6MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2023-10-12 17:24:21,732 INFO L158 Benchmark]: BuchiAutomizer took 34324.05ms. Allocated memory was 324.0MB in the beginning and 1.3GB in the end (delta: 996.1MB). Free memory was 294.6MB in the beginning and 502.1MB in the end (delta: -207.4MB). Peak memory consumption was 973.8MB. Max. memory is 8.0GB. [2023-10-12 17:24:21,736 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.22ms. Allocated memory is still 191.9MB. Free memory was 147.6MB in the beginning and 147.4MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.73ms. Allocated memory is still 191.9MB. Free memory was 146.1MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 191.9MB. Free memory was 144.5MB in the beginning and 143.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 421.30ms. Allocated memory was 191.9MB in the beginning and 324.0MB in the end (delta: 132.1MB). Free memory was 143.1MB in the beginning and 294.8MB in the end (delta: -151.6MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 34324.05ms. Allocated memory was 324.0MB in the beginning and 1.3GB in the end (delta: 996.1MB). Free memory was 294.6MB in the beginning and 502.1MB in the end (delta: -207.4MB). Peak memory consumption was 973.8MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 4 + -1 * i_16 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_19 + 4 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.2s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 6.0s. Construction of modules took 0.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 72 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf100 lsp466 ukn16 mio100 lsp100 div100 bol136 ite100 ukn100 eq142 hnf99 smp100 dnf499 smp19 tf100 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 374ms VariablesStem: 6 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.3s, 29 PlacesBefore, 24 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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:24:21,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...