/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:51,292 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:51,350 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:36:51,372 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:51,372 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:51,373 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:51,374 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:51,374 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:51,375 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:51,377 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:51,377 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:51,378 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:51,378 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:51,379 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:51,379 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:51,379 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:51,380 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:51,381 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:51,382 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:51,382 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:51,382 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:51,382 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:51,384 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:51,384 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:36:51,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:51,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:51,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:51,562 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:51,570 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:51,571 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 [2023-10-12 17:36:51,571 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl' [2023-10-12 17:36:51,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:51,594 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:51,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:51,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:51,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:51,612 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,619 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,623 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:51,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:51,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:51,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:51,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:51,636 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,636 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,637 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,638 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,640 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,643 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,644 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,645 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 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:51,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:51,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:51,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:51,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:51" (1/1) ... [2023-10-12 17:36:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:51,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:51,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:36:51,735 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countEven given in one single declaration [2023-10-12 17:36:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure countEven [2023-10-12 17:36:51,737 INFO L138 BoogieDeclarations]: Found implementation of procedure countEven [2023-10-12 17:36:51,737 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countZero given in one single declaration [2023-10-12 17:36:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure countZero [2023-10-12 17:36:51,737 INFO L138 BoogieDeclarations]: Found implementation of procedure countZero [2023-10-12 17:36:51,738 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:51,738 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:36:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:36:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:36:51,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:36:51,739 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:36:51,739 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:36:51,739 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:36:51,775 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:51,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:51,868 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:51,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:51,873 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:51,874 INFO L201 PluginConnector]: Adding new model count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:51 BoogieIcfgContainer [2023-10-12 17:36:51,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:51,881 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:51,881 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:51,884 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:51,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:51,885 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:51" (1/2) ... [2023-10-12 17:36:51,886 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ae0e311 and model type count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:51, skipping insertion in model container [2023-10-12 17:36:51,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:51,886 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 12.10 05:36:51" (2/2) ... [2023-10-12 17:36:51,887 INFO L332 chiAutomizerObserver]: Analyzing ICFG count0-countEven-sample-abs.bpl [2023-10-12 17:36:51,953 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:36:51,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 112 flow [2023-10-12 17:36:51,991 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2023-10-12 17:36:51,991 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:51,995 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. [2023-10-12 17:36:51,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 112 flow [2023-10-12 17:36:51,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 35 transitions, 88 flow [2023-10-12 17:36:52,001 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:52,014 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 88 flow [2023-10-12 17:36:52,016 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 88 flow [2023-10-12 17:36:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 88 flow [2023-10-12 17:36:52,026 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2023-10-12 17:36:52,027 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:52,027 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 88 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. [2023-10-12 17:36:52,028 INFO L119 LiptonReduction]: Number of co-enabled transitions 666 [2023-10-12 17:36:52,410 INFO L134 LiptonReduction]: Checked pairs total: 541 [2023-10-12 17:36:52,410 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:36:52,423 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:52,423 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:52,423 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:52,423 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:52,424 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:52,424 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:52,424 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:52,426 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:52,427 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 18 transitions, 54 flow [2023-10-12 17:36:52,430 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][6], 3:2A:[140] $Ultimate##0-->L32-1: Formula: (and (= v_cntZero_18 0) (= v_countZeroThread1of1ForFork0_i1_27 0)) InVars {} OutVars{cntZero=v_cntZero_18, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_27} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1][13]][4:3A:[148] L32-1-->L32-1: Formula: (let ((.cse0 (= v_countZeroThread1of1ForFork0_i1_Out_2 (+ v_countZeroThread1of1ForFork0_i1_In_1 1))) (.cse1 (< v_countZeroThread1of1ForFork0_i1_In_1 v_N_In_1)) (.cse2 (= (select v_A_In_1 v_countZeroThread1of1ForFork0_i1_In_1) 0))) (or (and .cse0 .cse1 (= v_cntZero_In_1 v_cntZero_Out_2) (not .cse2)) (and (= (+ v_cntZero_In_1 1) v_cntZero_Out_2) .cse0 .cse1 .cse2))) InVars {A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_In_1, cntZero=v_cntZero_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_Out_2, cntZero=v_cntZero_Out_2} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1][16]] [2023-10-12 17:36:52,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:52,435 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:52,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:52,435 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:52,437 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:52,437 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 18 transitions, 54 flow [2023-10-12 17:36:52,438 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][6], 3:2A:[140] $Ultimate##0-->L32-1: Formula: (and (= v_cntZero_18 0) (= v_countZeroThread1of1ForFork0_i1_27 0)) InVars {} OutVars{cntZero=v_cntZero_18, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_27} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1][13]][4:3A:[148] L32-1-->L32-1: Formula: (let ((.cse0 (= v_countZeroThread1of1ForFork0_i1_Out_2 (+ v_countZeroThread1of1ForFork0_i1_In_1 1))) (.cse1 (< v_countZeroThread1of1ForFork0_i1_In_1 v_N_In_1)) (.cse2 (= (select v_A_In_1 v_countZeroThread1of1ForFork0_i1_In_1) 0))) (or (and .cse0 .cse1 (= v_cntZero_In_1 v_cntZero_Out_2) (not .cse2)) (and (= (+ v_cntZero_In_1 1) v_cntZero_Out_2) .cse0 .cse1 .cse2))) InVars {A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_In_1, cntZero=v_cntZero_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_Out_2, cntZero=v_cntZero_Out_2} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1][16]] [2023-10-12 17:36:52,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:52,438 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:52,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:52,439 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:52,442 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 [140] $Ultimate##0-->L32-1: Formula: (and (= v_cntZero_18 0) (= v_countZeroThread1of1ForFork0_i1_27 0)) InVars {} OutVars{cntZero=v_cntZero_18, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_27} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1] 55#[L32-1, L76]true [2023-10-12 17:36:52,442 INFO L750 eck$LassoCheckResult]: Loop: 55#[L32-1, L76]true [148] L32-1-->L32-1: Formula: (let ((.cse0 (= v_countZeroThread1of1ForFork0_i1_Out_2 (+ v_countZeroThread1of1ForFork0_i1_In_1 1))) (.cse1 (< v_countZeroThread1of1ForFork0_i1_In_1 v_N_In_1)) (.cse2 (= (select v_A_In_1 v_countZeroThread1of1ForFork0_i1_In_1) 0))) (or (and .cse0 .cse1 (= v_cntZero_In_1 v_cntZero_Out_2) (not .cse2)) (and (= (+ v_cntZero_In_1 1) v_cntZero_Out_2) .cse0 .cse1 .cse2))) InVars {A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_In_1, cntZero=v_cntZero_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_Out_2, cntZero=v_cntZero_Out_2} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1] 55#[L32-1, L76]true [2023-10-12 17:36:52,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 4759, now seen corresponding path program 1 times [2023-10-12 17:36:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110189184] [2023-10-12 17:36:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:52,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 1 times [2023-10-12 17:36:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205230171] [2023-10-12 17:36:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:52,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 147677, now seen corresponding path program 1 times [2023-10-12 17:36:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720792073] [2023-10-12 17:36:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:52,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:52,693 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:52,693 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:52,693 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:52,693 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:52,693 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:52,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:52,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:52,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:52,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:52,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:52,694 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:52,708 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:52,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:52,856 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:52,859 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:52,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:52,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:52,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:36:52,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:52,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:52,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:52,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:52,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:52,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:52,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:52,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:52,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:52,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:36:52,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:52,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:52,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:52,921 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:36:52,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:52,948 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:36:52,948 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:36:52,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:52,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:52,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:52,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:52,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:36:52,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:52,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:52,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:52,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:53,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:53,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:53,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:53,021 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:36:53,021 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:53,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:53,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:53,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:36:53,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:53,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:53,086 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:53,086 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, countZeroThread1of1ForFork0_i1) = 1*N - 1*countZeroThread1of1ForFork0_i1 Supporting invariants [] [2023-10-12 17:36:53,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:53,109 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:53,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:53,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:53,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:53,146 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:36:53,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:53,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-10-12 17:36:53,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:36:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:53,267 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 72 transitions, 360 flow [2023-10-12 17:36:53,267 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:53,267 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 72 transitions, 360 flow [2023-10-12 17:36:53,269 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][26], 2:2A:[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][30], 8:3A:[131] $Ultimate##0-->L48-1: Formula: (and (= v_cntEven_15 0) (= v_countEvenThread1of1ForFork1_i2_17 0)) InVars {} OutVars{cntEven=v_cntEven_15, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_17} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2][42]][10:4A:[150] L48-1-->L48-1: Formula: (let ((.cse0 (< v_countEvenThread1of1ForFork1_i2_In_1 v_N_In_3)) (.cse1 ((_ divisible 2) (select v_A_In_3 v_countEvenThread1of1ForFork1_i2_In_1))) (.cse2 (= (+ v_countEvenThread1of1ForFork1_i2_In_1 1) v_countEvenThread1of1ForFork1_i2_Out_2))) (or (and .cse0 (= v_cntEven_In_1 v_cntEven_Out_2) (not .cse1) .cse2) (and .cse0 (= v_cntEven_Out_2 (+ v_cntEven_In_1 1)) .cse1 .cse2))) InVars {A=v_A_In_3, cntEven=v_cntEven_In_1, N=v_N_In_3, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_In_1} OutVars{A=v_A_In_3, cntEven=v_cntEven_Out_2, N=v_N_In_3, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_Out_2} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2][70]] [2023-10-12 17:36:53,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:53,270 INFO L124 PetriNetUnfolderBase]: 3/9 cut-off events. [2023-10-12 17:36:53,270 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:53,270 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:53,270 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] 90#[$Ultimate##0, $Ultimate##0, L77]true [131] $Ultimate##0-->L48-1: Formula: (and (= v_cntEven_15 0) (= v_countEvenThread1of1ForFork1_i2_17 0)) InVars {} OutVars{cntEven=v_cntEven_15, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_17} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2] 92#[$Ultimate##0, L48-1, L77]true [2023-10-12 17:36:53,270 INFO L750 eck$LassoCheckResult]: Loop: 92#[$Ultimate##0, L48-1, L77]true [150] L48-1-->L48-1: Formula: (let ((.cse0 (< v_countEvenThread1of1ForFork1_i2_In_1 v_N_In_3)) (.cse1 ((_ divisible 2) (select v_A_In_3 v_countEvenThread1of1ForFork1_i2_In_1))) (.cse2 (= (+ v_countEvenThread1of1ForFork1_i2_In_1 1) v_countEvenThread1of1ForFork1_i2_Out_2))) (or (and .cse0 (= v_cntEven_In_1 v_cntEven_Out_2) (not .cse1) .cse2) (and .cse0 (= v_cntEven_Out_2 (+ v_cntEven_In_1 1)) .cse1 .cse2))) InVars {A=v_A_In_3, cntEven=v_cntEven_In_1, N=v_N_In_3, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_In_1} OutVars{A=v_A_In_3, cntEven=v_cntEven_Out_2, N=v_N_In_3, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_Out_2} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2] 92#[$Ultimate##0, L48-1, L77]true [2023-10-12 17:36:53,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 147071, now seen corresponding path program 1 times [2023-10-12 17:36:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066614314] [2023-10-12 17:36:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:53,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 181, now seen corresponding path program 1 times [2023-10-12 17:36:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034758289] [2023-10-12 17:36:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:53,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 4559351, now seen corresponding path program 1 times [2023-10-12 17:36:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33969769] [2023-10-12 17:36:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:53,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:53,361 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:53,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:53,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:53,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:53,362 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:53,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:53,362 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:53,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:53,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:53,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:53,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:53,363 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:53,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:53,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:53,393 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:53,394 INFO L117 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: divisible @term: ((_ 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.variables.InequalityConverter.convert(InequalityConverter.java:136) at de.uni_freiburg.informatik.ultimate.lassoranker.LinearTransition.fromTransFormulaLR(LinearTransition.java:211) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.constructPolyhedra(LassoBuilder.java:201) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:285) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:615) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:361) 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) [2023-10-12 17:36:53,475 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: divisible @term: ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:622) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:361) 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) [2023-10-12 17:36:53,477 INFO L158 Benchmark]: Toolchain (without parser) took 1883.60ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 97.2MB in the end (delta: 42.0MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2023-10-12 17:36:53,478 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 190.8MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:53,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 137.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:53,478 INFO L158 Benchmark]: Boogie Preprocessor took 15.85ms. Allocated memory is still 190.8MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:53,479 INFO L158 Benchmark]: RCFGBuilder took 228.11ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 125.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:36:53,479 INFO L158 Benchmark]: BuchiAutomizer took 1595.96ms. Allocated memory is still 190.8MB. Free memory was 125.6MB in the beginning and 97.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:53,480 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.17ms. Allocated memory is still 190.8MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 137.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.85ms. Allocated memory is still 190.8MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.11ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 125.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1595.96ms. Allocated memory is still 190.8MB. Free memory was 125.6MB in the beginning and 97.2MB in the end (delta: 28.4MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 43 PlacesBefore, 28 PlacesAfterwards, 35 TransitionsBefore, 18 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 541 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 486, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 361, independent conditional: 0, independent unconditional: 361, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 366, independent: 353, independent conditional: 0, independent unconditional: 353, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 486, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 366, unknown conditional: 0, unknown unconditional: 366] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: TermException de.uni_freiburg.informatik.ultimate.lassoranker.exceptions.UnknownFunctionException: Unknown function symbol: divisible @term: ((_ 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: divisible @term: ((_ divisible 2) |v_array_A[countEvenThread1of1ForFork1_i2]_3|): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:622) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-10-12 17:36:53,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:53,707 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...