/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 false -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:57:46,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:57:46,446 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:57:46,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:57:46,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:57:46,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:57:46,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:57:46,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:57:46,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:57:46,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:57:46,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:57:46,521 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:57:46,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:57:46,522 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:57:46,522 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:57:46,522 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:57:46,523 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:57:46,523 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:57:46,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:57:46,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:57:46,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:57:46,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:57:46,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:57:46,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:57:46,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:57:46,526 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:57:46,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:57:46,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:57:46,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:57:46,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:57:46,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:57:46,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:57:46,528 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:57:46,528 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 -> false [2024-02-10 00:57:47,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:57:47,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:57:47,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:57:47,117 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:57:47,118 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:57:47,119 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:57:47,120 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:57:47,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:57:47,160 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:57:47,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:47,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:57:47,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:57:47,185 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:57:47" (1/1) ... [2024-02-10 00:57:47,207 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:57:47" (1/1) ... [2024-02-10 00:57:47,212 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:57:47,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:47,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:57:47,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:57:47,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:57:47,271 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:57:47" (1/1) ... [2024-02-10 00:57:47,271 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:57:47" (1/1) ... [2024-02-10 00:57:47,272 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:57:47" (1/1) ... [2024-02-10 00:57:47,272 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:57:47" (1/1) ... [2024-02-10 00:57:47,291 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:57:47" (1/1) ... [2024-02-10 00:57:47,294 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:57:47" (1/1) ... [2024-02-10 00:57:47,295 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:57:47" (1/1) ... [2024-02-10 00:57:47,295 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:57:47" (1/1) ... [2024-02-10 00:57:47,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:57:47,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:57:47,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:57:47,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:57:47,316 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:57:47" (1/1) ... [2024-02-10 00:57:47,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:47,381 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:57:47,430 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:57:47,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countEven given in one single declaration [2024-02-10 00:57:47,489 INFO L130 BoogieDeclarations]: Found specification of procedure countEven [2024-02-10 00:57:47,489 INFO L138 BoogieDeclarations]: Found implementation of procedure countEven [2024-02-10 00:57:47,490 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countZero given in one single declaration [2024-02-10 00:57:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure countZero [2024-02-10 00:57:47,490 INFO L138 BoogieDeclarations]: Found implementation of procedure countZero [2024-02-10 00:57:47,490 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:57:47,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:57:47,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:57:47,491 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 00:57:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 00:57:47,491 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 00:57:47,491 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 00:57:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 00:57:47,491 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 00:57:47,492 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:57:47,570 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:57:47,571 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:57:47,818 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:57:47,824 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:57:47,825 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:57:47,827 INFO L201 PluginConnector]: Adding new model count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:57:47 BoogieIcfgContainer [2024-02-10 00:57:47,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:57:47,829 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:57:47,829 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:57:47,838 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:57:47,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:47,839 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:57:47" (1/2) ... [2024-02-10 00:57:47,840 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@729dbef2 and model type count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:57:47, skipping insertion in model container [2024-02-10 00:57:47,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:47,840 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:57:47" (2/2) ... [2024-02-10 00:57:47,850 INFO L332 chiAutomizerObserver]: Analyzing ICFG count0-countEven-sample-abs.bpl [2024-02-10 00:57:48,000 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:57:48,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 108 flow [2024-02-10 00:57:48,096 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2024-02-10 00:57:48,112 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:48,117 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:57:48,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 108 flow [2024-02-10 00:57:48,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 35 transitions, 88 flow [2024-02-10 00:57:48,127 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:57:48,128 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:57:48,128 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:57:48,128 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:57:48,128 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:57:48,128 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:57:48,128 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:57:48,128 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:57:48,129 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 35 transitions, 88 flow [2024-02-10 00:57:48,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:48,145 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2024-02-10 00:57:48,160 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:57:48,160 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:48,165 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:57:48,165 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 35 transitions, 88 flow [2024-02-10 00:57:48,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:48,171 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2024-02-10 00:57:48,171 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:57:48,171 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:48,176 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [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] 53#[$Ultimate##0, L76]true [99] $Ultimate##0-->L30: Formula: (= v_cntZero_1 0) InVars {} OutVars{cntZero=v_cntZero_1} AuxVars[] AssignedVars[cntZero] 55#[L30, L76]true [100] L30-->L32-1: Formula: (= v_countZeroThread1of1ForFork0_i1_1 0) InVars {} OutVars{countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[countZeroThread1of1ForFork0_i1] 57#[L32-1, L76]true [2024-02-10 00:57:48,176 INFO L750 eck$LassoCheckResult]: Loop: 57#[L32-1, L76]true [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[] 60#[L33, L76]true [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[] 62#[L33-2, L76]true [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] 57#[L32-1, L76]true [2024-02-10 00:57:48,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 146358, now seen corresponding path program 1 times [2024-02-10 00:57:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488935571] [2024-02-10 00:57:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:48,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash 131175, now seen corresponding path program 1 times [2024-02-10 00:57:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:48,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101107624] [2024-02-10 00:57:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:48,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash 65285266, now seen corresponding path program 1 times [2024-02-10 00:57:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:48,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505207361] [2024-02-10 00:57:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:48,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:48,597 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:48,598 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:48,598 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:48,598 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:48,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:48,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:48,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:48,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:48,599 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:57:48,599 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:48,599 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:48,610 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:57:48,652 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:57:48,665 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:57:48,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:57:48,796 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:57:48,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:48,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:48,814 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:57:48,824 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:57:48,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:48,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:48,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:48,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:48,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:48,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:48,872 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:57:48,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:48,890 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:57:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:48,895 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:57:48,901 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:57:48,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:48,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:48,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:48,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:48,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:48,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:48,929 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:57:48,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:48,944 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:57:48,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:48,946 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:57:48,955 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:57:48,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:48,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:48,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:48,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:48,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:48,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:49,004 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:57:49,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:57:49,025 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:57:49,025 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:57:49,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:49,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:49,032 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:57:49,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:57:49,045 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:57:49,053 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:57:49,053 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:57:49,054 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, countZeroThread1of1ForFork0_i1) = 1*N - 1*countZeroThread1of1ForFork0_i1 Supporting invariants [] [2024-02-10 00:57:49,062 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:57:49,065 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:57:49,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:49,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:57:49,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:49,150 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:57:49,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:49,197 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:57:49,258 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:57:49,270 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:57:49,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:49,565 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:57:49,567 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:57:49,567 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:57:49,568 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:57:49,660 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:57:49,661 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:57:49,663 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:57:49,667 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:57:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 00:57:49,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:57:49,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:49,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:57:49,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:49,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:57:49,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:49,679 INFO L428 stractBuchiCegarLoop]: Abstraction has has 52 places, 439 transitions, 1975 flow [2024-02-10 00:57:49,679 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:57:49,679 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 439 transitions, 1975 flow [2024-02-10 00:57:49,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:49,908 INFO L124 PetriNetUnfolderBase]: 505/641 cut-off events. [2024-02-10 00:57:49,908 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-02-10 00:57:49,908 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:49,909 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [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] 53#[$Ultimate##0, L76]true [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] 118#[$Ultimate##0, $Ultimate##0, L77]true [90] $Ultimate##0-->L46: Formula: (= v_cntEven_1 0) InVars {} OutVars{cntEven=v_cntEven_1} AuxVars[] AssignedVars[cntEven] 120#[L46, $Ultimate##0, L77]true [91] L46-->L48-1: Formula: (= v_countEvenThread1of1ForFork1_i2_1 0) InVars {} OutVars{countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[countEvenThread1of1ForFork1_i2] 122#[$Ultimate##0, L77, L48-1]true [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[] 124#[L49, $Ultimate##0, L77]true [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[] 126#[$Ultimate##0, L49-2, L77]true [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] 122#[$Ultimate##0, L77, L48-1]true [2024-02-10 00:57:49,909 INFO L750 eck$LassoCheckResult]: Loop: 122#[$Ultimate##0, L77, L48-1]true [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[] 124#[L49, $Ultimate##0, L77]true [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[] 126#[$Ultimate##0, L49-2, L77]true [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] 122#[$Ultimate##0, L77, L48-1]true [2024-02-10 00:57:49,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1650857414, now seen corresponding path program 1 times [2024-02-10 00:57:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752478540] [2024-02-10 00:57:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:49,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:49,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:49,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 1 times [2024-02-10 00:57:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692533408] [2024-02-10 00:57:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:49,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:49,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:49,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 977378469, now seen corresponding path program 2 times [2024-02-10 00:57:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101970588] [2024-02-10 00:57:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:50,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:50,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:50,169 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:50,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:50,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:50,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:50,170 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:50,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:50,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:50,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:50,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:57:50,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:50,170 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:50,171 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:57:50,223 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:57:50,227 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:57:50,229 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:57:50,231 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:57:50,234 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[0]_1|)) 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:200) 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:57:50,323 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[0]_1|)) 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:57:50,336 INFO L158 Benchmark]: Toolchain (without parser) took 3167.08ms. Allocated memory was 174.1MB in the beginning and 225.4MB in the end (delta: 51.4MB). Free memory was 141.3MB in the beginning and 151.7MB in the end (delta: -10.4MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2024-02-10 00:57:50,336 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 174.1MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:57:50,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.46ms. Allocated memory is still 174.1MB. Free memory was 141.3MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:57:50,338 INFO L158 Benchmark]: Boogie Preprocessor took 72.33ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 146.9MB in the end (delta: -7.2MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. [2024-02-10 00:57:50,339 INFO L158 Benchmark]: RCFGBuilder took 530.27ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 136.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:57:50,343 INFO L158 Benchmark]: BuchiAutomizer took 2497.55ms. Allocated memory was 174.1MB in the beginning and 225.4MB in the end (delta: 51.4MB). Free memory was 136.2MB in the beginning and 151.7MB in the end (delta: -15.5MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2024-02-10 00:57:50,346 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.78ms. Allocated memory is still 174.1MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.46ms. Allocated memory is still 174.1MB. Free memory was 141.3MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.33ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 146.9MB in the end (delta: -7.2MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. * RCFGBuilder took 530.27ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 136.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2497.55ms. Allocated memory was 174.1MB in the beginning and 225.4MB in the end (delta: 51.4MB). Free memory was 136.2MB in the beginning and 151.7MB in the end (delta: -15.5MB). Peak memory consumption was 35.6MB. 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[0]_1|)) 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[0]_1|)): 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:57:50,384 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...