/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/count0-countEven-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:24:39,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:24:39,775 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:39,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:24:39,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:24:39,783 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:39,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:24:39,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:24:39,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:24:39,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:24:39,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:24:39,817 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:24:39,817 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:24:39,818 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:24:39,819 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:24:39,819 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:24:39,819 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:24:39,819 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:24:39,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:24:39,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:24:39,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:24:39,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:24:39,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:24:39,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:24:39,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:24:39,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:24:39,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:24:39,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:24:39,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:24:39,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:24:39,823 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:24:39,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:24:39,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:24:39,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:24:39,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:24:39,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:24:39,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:24:39,824 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:24:39,824 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:40,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:24:40,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:24:40,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:24:40,172 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:24:40,177 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:24:40,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl [2024-02-10 00:24:40,181 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl' [2024-02-10 00:24:40,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:24:40,226 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:24:40,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:40,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:24:40,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:24:40,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,320 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:24:40,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:40,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:24:40,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:24:40,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:24:40,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:24:40,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:24:40,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:24:40,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:24:40,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/1) ... [2024-02-10 00:24:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:40,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:40,442 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:40,449 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:40,518 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countEven given in one single declaration [2024-02-10 00:24:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure countEven [2024-02-10 00:24:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure countEven [2024-02-10 00:24:40,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countZero given in one single declaration [2024-02-10 00:24:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure countZero [2024-02-10 00:24:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure countZero [2024-02-10 00:24:40,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:24:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:24:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:24:40,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 00:24:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 00:24:40,520 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 00:24:40,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 00:24:40,528 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 00:24:40,528 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 00:24:40,529 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:40,608 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:24:40,610 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:24:40,786 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:24:40,793 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:24:40,793 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:24:40,795 INFO L201 PluginConnector]: Adding new model count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:24:40 BoogieIcfgContainer [2024-02-10 00:24:40,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:24:40,797 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:24:40,797 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:24:40,801 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:24:40,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:40,801 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:24:40" (1/2) ... [2024-02-10 00:24:40,803 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fbe397b and model type count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:24:40, skipping insertion in model container [2024-02-10 00:24:40,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:40,803 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:24:40" (2/2) ... [2024-02-10 00:24:40,804 INFO L332 chiAutomizerObserver]: Analyzing ICFG count0-countEven-sample-abs.bpl [2024-02-10 00:24:40,877 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:24:40,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 108 flow [2024-02-10 00:24:40,922 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2024-02-10 00:24:40,922 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:24:40,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-02-10 00:24:40,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 108 flow [2024-02-10 00:24:40,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 35 transitions, 88 flow [2024-02-10 00:24:40,938 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:24:40,939 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:24:40,939 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:24:40,939 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:24:40,939 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:24:40,939 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:24:40,939 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:24:40,939 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:24:40,940 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:40,941 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 43 places, 35 transitions, 88 flow [2024-02-10 00:24:41,059 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1633 states, 1631 states have (on average 3.818516247700797) internal successors, (6228), 1632 states have internal predecessors, (6228), 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,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1633 states, 1631 states have (on average 3.818516247700797) internal successors, (6228), 1632 states have internal predecessors, (6228), 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,149 INFO L131 ngComponentsAnalysis]: Automaton has 229 accepting balls. 1348 [2024-02-10 00:24:41,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:41,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:41,153 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:24:41,153 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:41,153 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 43 places, 35 transitions, 88 flow [2024-02-10 00:24:41,192 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1633 states, 1631 states have (on average 3.818516247700797) internal successors, (6228), 1632 states have internal predecessors, (6228), 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,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1633 states, 1631 states have (on average 3.818516247700797) internal successors, (6228), 1632 states have internal predecessors, (6228), 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,224 INFO L131 ngComponentsAnalysis]: Automaton has 229 accepting balls. 1348 [2024-02-10 00:24:41,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:41,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:41,229 INFO L748 eck$LassoCheckResult]: Stem: Black: 3318#[$Ultimate##0]don't care [118] $Ultimate##0-->$Ultimate##0: Formula: (= v_countZeroThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{countZeroThread1of1ForFork0_thidvar0=v_countZeroThread1of1ForFork0_thidvar0_2, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_16} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_thidvar0, countZeroThread1of1ForFork0_i1] 3321#[$Ultimate##0, L76]don't care [99] $Ultimate##0-->L30: Formula: (= v_cntZero_1 0) InVars {} OutVars{cntZero=v_cntZero_1} AuxVars[] AssignedVars[cntZero] 3323#[L30, L76]don't care [100] L30-->L32-1: Formula: (= v_countZeroThread1of1ForFork0_i1_1 0) InVars {} OutVars{countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_i1] 3327#[L32-1, L76]don't care [2024-02-10 00:24:41,229 INFO L750 eck$LassoCheckResult]: Loop: 3327#[L32-1, L76]don't care [102] L32-1-->L33: Formula: (< v_countZeroThread1of1ForFork0_i1_5 v_N_4) InVars {countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_5, N=v_N_4} OutVars{countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_5, N=v_N_4} AuxVars[] AssignedVars[] 3339#[L33, L76]don't care [105] L33-->L33-2: Formula: (not (= (select v_A_4 v_countZeroThread1of1ForFork0_i1_9) 0)) InVars {A=v_A_4, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_9} OutVars{A=v_A_4, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_9} AuxVars[] AssignedVars[] 3365#[L76, L33-2]don't care [107] L33-2-->L32-1: Formula: (= v_countZeroThread1of1ForFork0_i1_12 (+ v_countZeroThread1of1ForFork0_i1_11 1)) InVars {countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_11} OutVars{countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_12} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_i1] 3327#[L32-1, L76]don't care [2024-02-10 00:24:41,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash 146358, now seen corresponding path program 1 times [2024-02-10 00:24:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398202313] [2024-02-10 00:24:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:41,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 131175, now seen corresponding path program 1 times [2024-02-10 00:24:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171523122] [2024-02-10 00:24:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:41,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 65285266, now seen corresponding path program 1 times [2024-02-10 00:24:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885149392] [2024-02-10 00:24:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:41,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:41,487 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:41,487 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:41,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:41,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:41,488 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:41,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:41,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:41,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:24:41,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:41,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:41,502 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:41,512 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:41,515 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:41,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:41,601 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:41,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:41,610 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:41,619 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:41,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:41,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:41,628 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:41,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:41,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:41,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:41,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:41,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:41,658 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:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:41,660 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:41,665 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:41,665 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:41,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:41,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:41,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:41,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:41,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:41,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:41,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:41,727 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:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:41,745 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:41,751 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:41,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:41,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:41,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:41,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:41,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:41,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:41,773 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:41,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:41,788 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:24:41,788 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:24:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:41,828 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:41,830 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:41,831 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:41,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:41,861 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:41,862 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, countZeroThread1of1ForFork0_i1) = 1*N - 1*countZeroThread1of1ForFork0_i1 Supporting invariants [] [2024-02-10 00:24:41,869 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:41,877 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:24:41,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:41,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:41,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:41,943 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:24:41,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:41,967 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:42,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 00:24:42,018 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:24:42,227 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:24:42,228 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:42,228 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:42,229 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:24:42,272 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:24:42,272 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:42,275 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:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:24:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 00:24:42,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:24:42,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:24:42,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:42,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:24:42,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:42,292 INFO L428 stractBuchiCegarLoop]: Abstraction has has 52 places, 439 transitions, 1975 flow [2024-02-10 00:24:42,293 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:24:42,293 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:42,293 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 52 places, 439 transitions, 1975 flow [2024-02-10 00:24:42,576 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 3440 states, 3434 states have (on average 5.7216074548631335) internal successors, (19648), 3439 states have internal predecessors, (19648), 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,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3440 states, 3434 states have (on average 5.7216074548631335) internal successors, (19648), 3439 states have internal predecessors, (19648), 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,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 00:24:42,727 INFO L131 ngComponentsAnalysis]: Automaton has 260 accepting balls. 1136 [2024-02-10 00:24:42,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:42,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:42,730 INFO L748 eck$LassoCheckResult]: Stem: Black: 6628#[$Ultimate##0]don't care [118] $Ultimate##0-->$Ultimate##0: Formula: (= v_countZeroThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{countZeroThread1of1ForFork0_thidvar0=v_countZeroThread1of1ForFork0_thidvar0_2, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_16} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_thidvar0, countZeroThread1of1ForFork0_i1] 6634#[L76, $Ultimate##0]don't care [121] L76-->$Ultimate##0: Formula: (and (= 2 v_countEvenThread1of1ForFork1_thidvar0_2) (= 2 v_countEvenThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{countEvenThread1of1ForFork1_thidvar1=v_countEvenThread1of1ForFork1_thidvar1_2, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_16, countEvenThread1of1ForFork1_thidvar0=v_countEvenThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[countEvenThread1of1ForFork1_thidvar1, countEvenThread1of1ForFork1_i2, countEvenThread1of1ForFork1_thidvar0] 6644#[$Ultimate##0, L77, $Ultimate##0]don't care [90] $Ultimate##0-->L46: Formula: (= v_cntEven_1 0) InVars {} OutVars{cntEven=v_cntEven_1} AuxVars[] AssignedVars[cntEven] 6662#[$Ultimate##0, L77, L46]don't care [91] L46-->L48-1: Formula: (= v_countEvenThread1of1ForFork1_i2_1 0) InVars {} OutVars{countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[countEvenThread1of1ForFork1_i2] 6710#[$Ultimate##0, L77, L48-1]don't care [2024-02-10 00:24:42,731 INFO L750 eck$LassoCheckResult]: Loop: 6710#[$Ultimate##0, L77, L48-1]don't care [93] L48-1-->L49: Formula: (< v_countEvenThread1of1ForFork1_i2_5 v_N_1) InVars {countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_5, N=v_N_1} OutVars{countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_5, N=v_N_1} AuxVars[] AssignedVars[] 6811#[$Ultimate##0, L77, L49]don't care [96] L49-->L49-2: Formula: (not ((_ divisible 2) (select v_A_2 v_countEvenThread1of1ForFork1_i2_9))) InVars {A=v_A_2, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_9} OutVars{A=v_A_2, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_9} AuxVars[] AssignedVars[] 6988#[$Ultimate##0, L77, L49-2]don't care [98] L49-2-->L48-1: Formula: (= (+ v_countEvenThread1of1ForFork1_i2_11 1) v_countEvenThread1of1ForFork1_i2_12) InVars {countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_11} OutVars{countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_12} AuxVars[] AssignedVars[countEvenThread1of1ForFork1_i2] 6710#[$Ultimate##0, L77, L48-1]don't care [2024-02-10 00:24:42,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 4558021, now seen corresponding path program 1 times [2024-02-10 00:24:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50498065] [2024-02-10 00:24:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 1 times [2024-02-10 00:24:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748563892] [2024-02-10 00:24:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1650857414, now seen corresponding path program 1 times [2024-02-10 00:24:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456219882] [2024-02-10 00:24:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,882 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:42,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:42,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:42,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:42,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:42,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:42,883 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:42,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:24:42,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:42,883 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:42,886 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,900 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,904 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,906 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,911 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,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true de.uni_freiburg.informatik.ultimate.lassoranker.exceptions.UnknownFunctionException: Unknown function symbol: not @term: (not ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|)) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.InequalityConverter.convert(InequalityConverter.java:157) at de.uni_freiburg.informatik.ultimate.lassoranker.LinearTransition.fromTransFormulaLR(LinearTransition.java:211) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.constructPolyhedra(LassoBuilder.java:201) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:285) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:615) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-02-10 00:24:42,992 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: TermException de.uni_freiburg.informatik.ultimate.lassoranker.exceptions.UnknownFunctionException: Unknown function symbol: not @term: (not ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|)) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:622) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-02-10 00:24:42,995 INFO L158 Benchmark]: Toolchain (without parser) took 2768.17ms. Allocated memory was 161.5MB in the beginning and 269.5MB in the end (delta: 108.0MB). Free memory was 116.1MB in the beginning and 198.5MB in the end (delta: -82.5MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2024-02-10 00:24:42,996 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.30ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:24:42,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.49ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 134.3MB in the end (delta: -18.3MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. [2024-02-10 00:24:42,996 INFO L158 Benchmark]: Boogie Preprocessor took 35.53ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 133.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:24:42,997 INFO L158 Benchmark]: RCFGBuilder took 414.25ms. Allocated memory is still 161.5MB. Free memory was 133.1MB in the beginning and 122.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:24:42,997 INFO L158 Benchmark]: BuchiAutomizer took 2197.08ms. Allocated memory was 161.5MB in the beginning and 269.5MB in the end (delta: 108.0MB). Free memory was 122.4MB in the beginning and 198.5MB in the end (delta: -76.1MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2024-02-10 00:24:43,000 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.30ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 103.49ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 134.3MB in the end (delta: -18.3MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.53ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 133.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 414.25ms. Allocated memory is still 161.5MB. Free memory was 133.1MB in the beginning and 122.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2197.08ms. Allocated memory was 161.5MB in the beginning and 269.5MB in the end (delta: 108.0MB). Free memory was 122.4MB in the beginning and 198.5MB in the end (delta: -76.1MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: TermException de.uni_freiburg.informatik.ultimate.lassoranker.exceptions.UnknownFunctionException: Unknown function symbol: not @term: (not ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|)) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: TermException de.uni_freiburg.informatik.ultimate.lassoranker.exceptions.UnknownFunctionException: Unknown function symbol: not @term: (not ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|)): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:622) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-02-10 00:24:43,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...