/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:00,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:00,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:00,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:00,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:00,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:00,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:00,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:00,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:00,506 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:00,506 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:00,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:00,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:00,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:00,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:00,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:00,508 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:00,508 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:00,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:00,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:00,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:00,747 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:00,748 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:00,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl [2025-04-26 16:21:00,748 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl' [2025-04-26 16:21:00,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:00,770 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:00,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:00,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:00,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:00,777 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,799 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,808 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:00,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:00,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:00,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:00,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:00,815 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,815 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,818 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,818 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,822 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,824 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,825 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,825 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 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:00,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:00,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:00,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:00,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:00" (1/1) ... [2025-04-26 16:21:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:00,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:00,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:00,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:00,892 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countEven given in one single declaration [2025-04-26 16:21:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure countEven [2025-04-26 16:21:00,892 INFO L138 BoogieDeclarations]: Found implementation of procedure countEven [2025-04-26 16:21:00,892 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countZero given in one single declaration [2025-04-26 16:21:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure countZero [2025-04-26 16:21:00,892 INFO L138 BoogieDeclarations]: Found implementation of procedure countZero [2025-04-26 16:21:00,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:00,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:00,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:21:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:21:00,893 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:21:00,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:21:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:21:00,893 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:21:00,894 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:21:00,931 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:00,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:01,037 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:01,037 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:01,047 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:01,047 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:01,048 INFO L201 PluginConnector]: Adding new model count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:01 BoogieIcfgContainer [2025-04-26 16:21:01,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:01,048 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:01,048 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:01,054 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:01,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:01,055 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:00" (1/2) ... [2025-04-26 16:21:01,057 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2868d239 and model type count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:01, skipping insertion in model container [2025-04-26 16:21:01,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:01,057 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 26.04 04:21:01" (2/2) ... [2025-04-26 16:21:01,058 INFO L376 chiAutomizerObserver]: Analyzing ICFG count0-countEven-sample-abs.bpl [2025-04-26 16:21:01,125 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 108 flow [2025-04-26 16:21:01,185 INFO L116 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-04-26 16:21:01,186 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:01,192 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 89 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. [2025-04-26 16:21:01,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 108 flow [2025-04-26 16:21:01,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 35 transitions, 88 flow [2025-04-26 16:21:01,196 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 35 transitions, 88 flow [2025-04-26 16:21:01,205 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:01,205 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:01,205 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:01,205 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:01,205 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:01,205 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:01,205 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:01,205 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:01,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:01,442 INFO L131 ngComponentsAnalysis]: Automaton has 229 accepting balls. 1348 [2025-04-26 16:21:01,443 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:01,443 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:01,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:01,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:01,447 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:01,447 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1632 states, but on-demand construction may add more states [2025-04-26 16:21:01,478 INFO L131 ngComponentsAnalysis]: Automaton has 229 accepting balls. 1348 [2025-04-26 16:21:01,478 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:01,479 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:01,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:01,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:01,483 INFO L752 eck$LassoCheckResult]: Stem: "[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]" "[99] $Ultimate##0-->L30: Formula: (= v_cntZero_1 0) InVars {} OutVars{cntZero=v_cntZero_1} AuxVars[] AssignedVars[cntZero]" "[100] L30-->L32-1: Formula: (= v_countZeroThread1of1ForFork0_i1_1 0) InVars {} OutVars{countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_i1]" [2025-04-26 16:21:01,485 INFO L754 eck$LassoCheckResult]: Loop: "[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[]" "[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[]" "[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]" [2025-04-26 16:21:01,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 146358, now seen corresponding path program 1 times [2025-04-26 16:21:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:01,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994582024] [2025-04-26 16:21:01,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:01,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:01,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:01,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:01,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:01,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:01,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 131175, now seen corresponding path program 1 times [2025-04-26 16:21:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:01,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695373912] [2025-04-26 16:21:01,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:01,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:01,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:01,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:01,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:01,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 65285266, now seen corresponding path program 1 times [2025-04-26 16:21:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:01,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114833145] [2025-04-26 16:21:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:01,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:01,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:01,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:01,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:01,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:01,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:01,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:01,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:01,701 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:01,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:01,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:01,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:01,702 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:01,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:01,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:01,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:01,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:01,703 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:01,703 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:01,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:01,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:01,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:01,807 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:01,810 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:01,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:01,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:01,818 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 [2025-04-26 16:21:01,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:01,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:01,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:01,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:01,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:01,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:01,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:01,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:01,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:01,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:21:01,890 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 [2025-04-26 16:21:01,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:01,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:01,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:01,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:01,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:01,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:01,911 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:01,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:01,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:01,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:01,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:01,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:21:01,922 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 [2025-04-26 16:21:01,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:01,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:01,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:01,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:01,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:01,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:01,945 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:01,954 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:21:01,954 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:01,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:01,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:21:01,963 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:01,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:01,981 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:01,981 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:01,982 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, countZeroThread1of1ForFork0_i1) = 1*N - 1*countZeroThread1of1ForFork0_i1 Supporting invariants [] [2025-04-26 16:21:01,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:01,990 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:02,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:02,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:02,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:02,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:02,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:02,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:02,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:02,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:02,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:21:02,114 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 [2025-04-26 16:21:02,117 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 1632 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:02,289 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 1632 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3790 states and 16642 transitions. Complement of second has 6 states. [2025-04-26 16:21:02,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:21:02,303 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:02,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:02,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:02,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:02,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:02,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:02,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3790 states and 16642 transitions. [2025-04-26 16:21:02,358 INFO L131 ngComponentsAnalysis]: Automaton has 260 accepting balls. 1136 [2025-04-26 16:21:02,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3790 states to 2980 states and 13219 transitions. [2025-04-26 16:21:02,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1662 [2025-04-26 16:21:02,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2156 [2025-04-26 16:21:02,414 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2980 states and 13219 transitions. [2025-04-26 16:21:02,415 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:02,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2980 states and 13219 transitions. [2025-04-26 16:21:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states and 13219 transitions. [2025-04-26 16:21:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2489. [2025-04-26 16:21:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2489 states have (on average 4.4359180393732425) internal successors, (in total 11041), 2488 states have internal predecessors, (11041), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 11041 transitions. [2025-04-26 16:21:02,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2489 states and 11041 transitions. [2025-04-26 16:21:02,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 2489 states and 11041 transitions. [2025-04-26 16:21:02,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:02,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2489 states and 11041 transitions. [2025-04-26 16:21:02,593 INFO L131 ngComponentsAnalysis]: Automaton has 260 accepting balls. 1136 [2025-04-26 16:21:02,593 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:02,593 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:02,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:02,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:02,594 INFO L752 eck$LassoCheckResult]: Stem: "[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]" "[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]" "[90] $Ultimate##0-->L46: Formula: (= v_cntEven_1 0) InVars {} OutVars{cntEven=v_cntEven_1} AuxVars[] AssignedVars[cntEven]" "[91] L46-->L48-1: Formula: (= v_countEvenThread1of1ForFork1_i2_1 0) InVars {} OutVars{countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[countEvenThread1of1ForFork1_i2]" [2025-04-26 16:21:02,594 INFO L754 eck$LassoCheckResult]: Loop: "[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[]" "[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[]" "[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]" [2025-04-26 16:21:02,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 4558021, now seen corresponding path program 1 times [2025-04-26 16:21:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:02,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485515171] [2025-04-26 16:21:02,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:02,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:02,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:02,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:02,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:02,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 1 times [2025-04-26 16:21:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:02,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325128918] [2025-04-26 16:21:02,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:02,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:02,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:02,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:02,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:02,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1650857414, now seen corresponding path program 1 times [2025-04-26 16:21:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:02,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564100296] [2025-04-26 16:21:02,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:02,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:02,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:02,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:02,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:02,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:02,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:02,677 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:02,677 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:02,677 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:02,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:02,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:02,677 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:02,677 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:02,677 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:02,677 INFO L132 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:02,677 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:02,677 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:02,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:02,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:02,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:02,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:02,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:02,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA 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:204) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.constructPolyhedra(LassoBuilder.java:201) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:252) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:619) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runSingleCegarLoop(BuchiAutomizerObserver.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:377) 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) [2025-04-26 16:21:02,749 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:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runSingleCegarLoop(BuchiAutomizerObserver.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:377) 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) [2025-04-26 16:21:02,752 INFO L158 Benchmark]: Toolchain (without parser) took 1982.12ms. Allocated memory was 155.2MB in the beginning and 159.4MB in the end (delta: 4.2MB). Free memory was 84.1MB in the beginning and 59.4MB in the end (delta: 24.7MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2025-04-26 16:21:02,752 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:02,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.74ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:02,753 INFO L158 Benchmark]: Boogie Preprocessor took 27.94ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:02,753 INFO L158 Benchmark]: RCFGBuilder took 209.80ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:02,753 INFO L158 Benchmark]: BuchiAutomizer took 1703.00ms. Allocated memory was 155.2MB in the beginning and 159.4MB in the end (delta: 4.2MB). Free memory was 71.1MB in the beginning and 59.4MB in the end (delta: 11.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2025-04-26 16:21:02,755 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.14ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.74ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.94ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 209.80ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1703.00ms. Allocated memory was 155.2MB in the beginning and 159.4MB in the end (delta: 4.2MB). Free memory was 71.1MB in the beginning and 59.4MB in the end (delta: 11.7MB). Peak memory consumption was 13.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:626) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-04-26 16:21:02,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...