/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:24:28,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:24:28,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:24:28,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:24:28,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:24:28,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:24:28,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:24:28,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:24:28,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:24:28,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:24:28,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:24:28,603 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:24:28,604 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:24:28,607 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:24:28,607 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:24:28,607 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:24:28,608 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:24:28,608 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:24:28,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:24:28,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:24:28,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:24:28,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:24:28,610 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:24:28,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:24:28,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:24:28,612 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:24:28,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:24:28,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:24:28,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:24:28,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:24:28,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:24:28,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:24:28,613 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:24:28,613 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:24:28,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:24:28,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:24:28,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:24:28,973 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:24:28,974 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:24:28,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl [2024-02-10 00:24:28,975 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl' [2024-02-10 00:24:29,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:24:29,011 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:24:29,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:29,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:24:29,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:24:29,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,088 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-10 00:24:29,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:29,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:24:29,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:24:29,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:24:29,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:24:29,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:24:29,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:24:29,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:24:29,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/1) ... [2024-02-10 00:24:29,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:29,173 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) [2024-02-10 00:24:29,193 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 [2024-02-10 00:24:29,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:24:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:24:29,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:24:29,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 00:24:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 00:24:29,216 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 00:24:29,217 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:24:29,261 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:24:29,262 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:24:29,339 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:24:29,349 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:24:29,349 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:24:29,351 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:24:29 BoogieIcfgContainer [2024-02-10 00:24:29,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:24:29,351 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:24:29,352 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:24:29,354 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:24:29,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:29,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:29" (1/2) ... [2024-02-10 00:24:29,356 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@707ca513 and model type array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:24:29, skipping insertion in model container [2024-02-10 00:24:29,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:29,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:24:29" (2/2) ... [2024-02-10 00:24:29,357 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-3threads.bpl [2024-02-10 00:24:29,428 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:24:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 129 flow [2024-02-10 00:24:29,495 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-02-10 00:24:29,496 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:24:29,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-10 00:24:29,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 129 flow [2024-02-10 00:24:29,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 48 transitions, 114 flow [2024-02-10 00:24:29,512 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:24:29,513 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:24:29,513 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:24:29,513 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:24:29,513 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:24:29,513 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:24:29,513 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:24:29,513 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:24:29,513 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:29,514 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 114 flow [2024-02-10 00:24:29,639 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 00:24:29,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 00:24:29,783 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2024-02-10 00:24:29,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:29,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:29,788 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:24:29,789 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:29,789 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 114 flow [2024-02-10 00:24:29,836 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 00:24:29,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 00:24:29,879 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2024-02-10 00:24:29,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:29,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:29,886 INFO L748 eck$LassoCheckResult]: Stem: Black: 5195#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 5198#[L54, $Ultimate##0]don't care [54] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 5202#[L38, L54]don't care [55] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 5210#[L39-1, L54]don't care [2024-02-10 00:24:29,888 INFO L750 eck$LassoCheckResult]: Loop: 5210#[L39-1, L54]don't care [57] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 5226#[L54, L40]don't care [59] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 5254#[L41, L54]don't care [60] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 5300#[L54, L44]don't care [61] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5370#[L54, L25]don't care [62] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 5470#[L54, L25-1]don't care [63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5608#[L45, L54]don't care [64] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5788#[L25-2, L54]don't care [65] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 6010#[L25-3, L54]don't care [66] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5210#[L39-1, L54]don't care [2024-02-10 00:24:29,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash 122815, now seen corresponding path program 1 times [2024-02-10 00:24:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:29,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535046717] [2024-02-10 00:24:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:29,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:29,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:29,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1174385188, now seen corresponding path program 1 times [2024-02-10 00:24:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198991677] [2024-02-10 00:24:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:30,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:30,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:30,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1932215262, now seen corresponding path program 1 times [2024-02-10 00:24:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:30,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953640780] [2024-02-10 00:24:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:30,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:30,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:30,204 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:30,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:30,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:30,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:30,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:30,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:30,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:30,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:24:30,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:30,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:30,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:30,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:30,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:30,338 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:30,341 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,346 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) [2024-02-10 00:24:30,356 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 [2024-02-10 00:24:30,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:30,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:30,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:30,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:30,368 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 [2024-02-10 00:24:30,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:30,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:30,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:30,396 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 [2024-02-10 00:24:30,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,398 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) [2024-02-10 00:24:30,403 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 [2024-02-10 00:24:30,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:30,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:30,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:30,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:30,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:30,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:30,423 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 [2024-02-10 00:24:30,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:30,433 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 [2024-02-10 00:24:30,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,583 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) [2024-02-10 00:24:30,590 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 [2024-02-10 00:24:30,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:30,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:30,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:30,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:30,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:30,616 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 [2024-02-10 00:24:30,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:30,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:30,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:30,637 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 [2024-02-10 00:24:30,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,639 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) [2024-02-10 00:24:30,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:24:30,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:30,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:30,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:30,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:30,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:30,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:30,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:30,657 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 [2024-02-10 00:24:30,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:30,667 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 [2024-02-10 00:24:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,713 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) [2024-02-10 00:24:30,715 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 [2024-02-10 00:24:30,717 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 [2024-02-10 00:24:30,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:30,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:30,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:30,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:30,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:30,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:30,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:30,755 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:24:30,755 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:24:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:30,783 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) [2024-02-10 00:24:30,813 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 [2024-02-10 00:24:30,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:30,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:30,843 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:30,843 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2024-02-10 00:24:30,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 00:24:30,860 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:24:30,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:30,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:30,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:30,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:24:30,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:24:31,058 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:24:31,059 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:24:31,242 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 686 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:24:31,243 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:31,243 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:31,244 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:24:31,286 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:24:31,286 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:24:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:24:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-02-10 00:24:31,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-10 00:24:31,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:31,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-10 00:24:31,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:31,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-10 00:24:31,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:31,303 INFO L428 stractBuchiCegarLoop]: Abstraction has has 64 places, 608 transitions, 2651 flow [2024-02-10 00:24:31,303 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:24:31,303 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:31,303 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 64 places, 608 transitions, 2651 flow [2024-02-10 00:24:31,431 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 [2024-02-10 00:24:31,652 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 5495 states, 5489 states have (on average 4.519038076152305) internal successors, (24805), 5494 states have internal predecessors, (24805), 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) [2024-02-10 00:24:31,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5495 states, 5489 states have (on average 4.519038076152305) internal successors, (24805), 5494 states have internal predecessors, (24805), 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) [2024-02-10 00:24:31,818 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 2268 [2024-02-10 00:24:31,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:31,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:31,821 INFO L748 eck$LassoCheckResult]: Stem: Black: 10394#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] Black: 10397#[$Ultimate##0, L54]don't care [98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] Black: 10402#[$Ultimate##0, L55, $Ultimate##0]don't care [67] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] Black: 10417#[L38, $Ultimate##0, L55]don't care [68] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 10448#[$Ultimate##0, L55, L39-1]don't care [2024-02-10 00:24:31,821 INFO L750 eck$LassoCheckResult]: Loop: 10448#[$Ultimate##0, L55, L39-1]don't care [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 10509#[L40, $Ultimate##0, L55]don't care [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 10633#[$Ultimate##0, L55, L41]don't care [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 10816#[L44, $Ultimate##0, L55]don't care [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 11094#[L25, $Ultimate##0, L55]don't care [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 11493#[$Ultimate##0, L55, L25-1]don't care [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 11991#[$Ultimate##0, L55, L45]don't care [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 12612#[L25-2, $Ultimate##0, L55]don't care [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 13352#[$Ultimate##0, L55, L25-3]don't care [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 10448#[$Ultimate##0, L55, L39-1]don't care [2024-02-10 00:24:31,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash 3849989, now seen corresponding path program 1 times [2024-02-10 00:24:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:31,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109180096] [2024-02-10 00:24:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:31,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1317439337, now seen corresponding path program 1 times [2024-02-10 00:24:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404000876] [2024-02-10 00:24:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:31,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1944556315, now seen corresponding path program 1 times [2024-02-10 00:24:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875973669] [2024-02-10 00:24:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:31,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:31,960 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:31,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:31,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:31,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:31,961 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:31,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:31,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:31,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:31,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:24:31,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:31,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:31,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:31,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:32,070 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:32,070 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:32,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:32,077 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 [2024-02-10 00:24:32,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:32,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:32,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:32,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,090 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 [2024-02-10 00:24:32,115 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 [2024-02-10 00:24:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,117 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) [2024-02-10 00:24:32,124 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 [2024-02-10 00:24:32,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:32,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:32,137 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 [2024-02-10 00:24:32,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 00:24:32,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,154 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) [2024-02-10 00:24:32,197 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 [2024-02-10 00:24:32,199 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 [2024-02-10 00:24:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:32,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:32,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,248 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 [2024-02-10 00:24:32,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,251 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) [2024-02-10 00:24:32,302 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 [2024-02-10 00:24:32,303 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 [2024-02-10 00:24:32,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:32,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:32,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:32,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,328 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 [2024-02-10 00:24:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,330 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) [2024-02-10 00:24:32,337 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 [2024-02-10 00:24:32,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:32,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:32,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:32,348 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 [2024-02-10 00:24:32,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:32,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,368 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) [2024-02-10 00:24:32,374 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 [2024-02-10 00:24:32,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:32,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:32,390 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 [2024-02-10 00:24:32,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:32,403 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 [2024-02-10 00:24:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,404 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:32,410 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 [2024-02-10 00:24:32,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:32,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:32,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:32,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:32,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:32,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:32,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:24:32,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:32,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:24:32,436 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:24:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:32,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:32,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:32,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:24:32,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:32,463 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:32,463 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2024-02-10 00:24:32,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:32,472 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:24:32,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:32,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:32,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:32,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:24:32,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:24:32,614 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:24:32,614 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-02-10 00:24:32,766 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 9 states and 686 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:24:32,767 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:32,767 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 686 transitions. [2024-02-10 00:24:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 686 transitions. [2024-02-10 00:24:32,786 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:24:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 686 transitions. [2024-02-10 00:24:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 686 transitions. [2024-02-10 00:24:32,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:33,189 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:24:33,190 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:24:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-02-10 00:24:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-02-10 00:24:33,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 9 letters. [2024-02-10 00:24:33,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:33,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 13 letters. Loop has 9 letters. [2024-02-10 00:24:33,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:33,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 18 letters. [2024-02-10 00:24:33,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:33,194 INFO L428 stractBuchiCegarLoop]: Abstraction has has 77 places, 10037 transitions, 63672 flow [2024-02-10 00:24:33,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:24:33,194 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:33,194 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 77 places, 10037 transitions, 63672 flow [2024-02-10 00:24:41,627 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 14319 states, 14289 states have (on average 6.0639652879837636) internal successors, (86648), 14318 states have internal predecessors, (86648), 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) [2024-02-10 00:24:41,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14319 states, 14289 states have (on average 6.0639652879837636) internal successors, (86648), 14318 states have internal predecessors, (86648), 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) [2024-02-10 00:24:41,834 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 3294 [2024-02-10 00:24:41,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:41,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:41,835 INFO L748 eck$LassoCheckResult]: Stem: Black: 24388#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] Black: 24391#[$Ultimate##0, L54]don't care [98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] Black: 24403#[$Ultimate##0, $Ultimate##0, L55]don't care [101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1] Black: 24449#[$Ultimate##0, $Ultimate##0, L56, $Ultimate##0]don't care [80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] Black: 24534#[$Ultimate##0, L56, L38, $Ultimate##0]don't care [81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 24715#[$Ultimate##0, L56, L39-1, $Ultimate##0]don't care [2024-02-10 00:24:41,835 INFO L750 eck$LassoCheckResult]: Loop: 24715#[$Ultimate##0, L56, L39-1, $Ultimate##0]don't care [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] Black: 25096#[$Ultimate##0, L56, L40, $Ultimate##0]don't care [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 25649#[$Ultimate##0, L56, L41, $Ultimate##0]don't care [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] Black: 26438#[$Ultimate##0, L56, L44, $Ultimate##0]don't care [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 27563#[$Ultimate##0, L56, L25, $Ultimate##0]don't care [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 29018#[$Ultimate##0, L56, L25-1, $Ultimate##0]don't care [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 30833#[$Ultimate##0, L45, L56, $Ultimate##0]don't care [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 32970#[$Ultimate##0, L25-2, L56, $Ultimate##0]don't care [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 35459#[$Ultimate##0, L56, L25-3, $Ultimate##0]don't care [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 24712#[$Ultimate##0, L56, L39-1, $Ultimate##0]don't care [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 25101#[$Ultimate##0, L56, L40, $Ultimate##0]don't care [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] Black: 25646#[$Ultimate##0, L56, L41, $Ultimate##0]don't care [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 26441#[$Ultimate##0, L56, L44, $Ultimate##0]don't care [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 27560#[$Ultimate##0, L56, L25, $Ultimate##0]don't care [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 29021#[$Ultimate##0, L56, L25-1, $Ultimate##0]don't care [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 30830#[$Ultimate##0, L45, L56, $Ultimate##0]don't care [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 32973#[$Ultimate##0, L25-2, L56, $Ultimate##0]don't care [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 35456#[$Ultimate##0, L56, L25-3, $Ultimate##0]don't care [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 24715#[$Ultimate##0, L56, L39-1, $Ultimate##0]don't care [2024-02-10 00:24:41,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash 119382786, now seen corresponding path program 1 times [2024-02-10 00:24:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585526746] [2024-02-10 00:24:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:41,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1935588447, now seen corresponding path program 1 times [2024-02-10 00:24:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044795773] [2024-02-10 00:24:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:41,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 812025954, now seen corresponding path program 1 times [2024-02-10 00:24:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500345707] [2024-02-10 00:24:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,021 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:42,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:42,021 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:42,021 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:42,021 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:42,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:42,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:42,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:24:42,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:42,022 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:42,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:24:42,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:42,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:42,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,179 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:24:42,183 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 [2024-02-10 00:24:42,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:42,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:42,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:42,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-02-10 00:24:42,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,213 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 [2024-02-10 00:24:42,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 00:24:42,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-02-10 00:24:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,239 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 00:24:42,242 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 [2024-02-10 00:24:42,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:42,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:42,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:42,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,269 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 00:24:42,272 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 [2024-02-10 00:24:42,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,301 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,309 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 [2024-02-10 00:24:42,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 00:24:42,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-02-10 00:24:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,336 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,343 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 [2024-02-10 00:24:42,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:42,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:42,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:42,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 00:24:42,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,370 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,373 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 [2024-02-10 00:24:42,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-10 00:24:42,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,400 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,415 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 [2024-02-10 00:24:42,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-02-10 00:24:42,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,447 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 [2024-02-10 00:24:42,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:42,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:42,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:42,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-10 00:24:42,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,488 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,491 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 [2024-02-10 00:24:42,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-10 00:24:42,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:42,518 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:24:42,518 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:24:42,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,519 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:24:42,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:42,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-02-10 00:24:42,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:42,540 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:42,540 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i#1, N) = -1*sumThread1of1ForFork2_i#1 + 1*N Supporting invariants [] [2024-02-10 00:24:42,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:42,549 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:24:42,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:42,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:42,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:42,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:24:42,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:24:42,638 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 00:24:42,638 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-02-10 00:24:42,716 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 8 states and 634 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:24:42,716 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:42,716 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 634 transitions. [2024-02-10 00:24:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2024-02-10 00:24:42,718 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:24:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 634 transitions. [2024-02-10 00:24:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2024-02-10 00:24:43,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-02-10 00:24:46,881 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:24:46,881 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:24:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-02-10 00:24:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2024-02-10 00:24:46,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 5 letters. Loop has 18 letters. [2024-02-10 00:24:46,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:46,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 23 letters. Loop has 18 letters. [2024-02-10 00:24:46,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:46,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 5 letters. Loop has 36 letters. [2024-02-10 00:24:46,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:46,884 INFO L428 stractBuchiCegarLoop]: Abstraction has has 89 places, 156172 transitions, 1299935 flow [2024-02-10 00:24:46,884 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:24:46,884 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:46,884 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 89 places, 156172 transitions, 1299935 flow Received shutdown request... [2024-02-10 00:28:54,183 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 00:28:54,214 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 00:28:54,227 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:28:54 BoogieIcfgContainer [2024-02-10 00:28:54,227 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:28:54,228 INFO L158 Benchmark]: Toolchain (without parser) took 265216.93ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 142.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. [2024-02-10 00:28:54,229 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:28:54,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.12ms. Allocated memory is still 179.3MB. Free memory was 142.4MB in the beginning and 153.4MB in the end (delta: -11.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2024-02-10 00:28:54,234 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 152.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:28:54,238 INFO L158 Benchmark]: RCFGBuilder took 219.66ms. Allocated memory is still 179.3MB. Free memory was 152.3MB in the beginning and 142.6MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:28:54,241 INFO L158 Benchmark]: BuchiAutomizer took 264875.98ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 142.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. [2024-02-10 00:28:54,242 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.09ms. Allocated memory is still 179.3MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.12ms. Allocated memory is still 179.3MB. Free memory was 142.4MB in the beginning and 153.4MB in the end (delta: -11.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 152.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 219.66ms. Allocated memory is still 179.3MB. Free memory was 152.3MB in the beginning and 142.6MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 264875.98ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 142.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 6.8GB. 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) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. The remainder module has 1299935 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 264.7s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 1. 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: 9/9 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 324 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital58 mio100 ax100 hnf100 lsp84 ukn63 mio100 lsp46 div100 bol100 ite100 ukn100 eq190 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown