/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/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:02:42,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:02:42,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:02:42,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:02:42,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:02:42,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:02:42,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:02:42,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:02:42,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:02:42,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:02:42,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:02:42,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:02:42,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:02:42,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:02:42,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:02:42,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:02:42,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:02:42,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:02:42,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:02:42,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:02:42,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:02:42,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:02:42,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:02:42,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:02:42,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:02:42,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:02:42,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:02:42,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:02:42,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:02:42,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:02:42,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:02:42,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:02:42,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:02:42,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:02:42,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:02:42,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:02:42,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:02:42,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:02:42,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:02:42,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:02:42,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:02:42,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf [2022-09-29 15:02:42,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:02:42,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:02:42,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:02:42,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:02:42,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:02:42,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:02:42,906 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:02:42,906 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:02:42,907 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:02:42,907 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:02:42,907 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:02:42,908 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:02:42,908 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:02:42,908 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 15:02:42,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:02:42,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:02:42,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:02:42,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:02:42,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:02:42,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:02:42,911 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:02:42,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:02:42,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:02:42,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:02:42,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:02:42,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:02:42,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:02:42,913 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:02:42,913 INFO L138 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 [2022-09-29 15:02:43,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:02:43,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:02:43,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:02:43,143 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:02:43,144 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:02:43,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl [2022-09-29 15:02:43,145 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/count0-countEven-sample-abs.bpl' [2022-09-29 15:02:43,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:02:43,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:02:43,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:02:43,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:02:43,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:02:43,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,208 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:02:43,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:02:43,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:02:43,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:02:43,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:02:43,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:02:43,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:02:43,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:02:43,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:02:43,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/1) ... [2022-09-29 15:02:43,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:43,271 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) [2022-09-29 15:02:43,279 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 [2022-09-29 15:02:43,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countEven given in one single declaration [2022-09-29 15:02:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure countEven [2022-09-29 15:02:43,306 INFO L138 BoogieDeclarations]: Found implementation of procedure countEven [2022-09-29 15:02:43,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure countZero given in one single declaration [2022-09-29 15:02:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure countZero [2022-09-29 15:02:43,306 INFO L138 BoogieDeclarations]: Found implementation of procedure countZero [2022-09-29 15:02:43,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:02:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:02:43,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:02:43,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2022-09-29 15:02:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2022-09-29 15:02:43,307 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2022-09-29 15:02:43,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2022-09-29 15:02:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2022-09-29 15:02:43,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2022-09-29 15:02:43,308 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:02:43,350 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:02:43,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:02:43,440 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:02:43,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:02:43,447 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 15:02:43,448 INFO L202 PluginConnector]: Adding new model count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:02:43 BoogieIcfgContainer [2022-09-29 15:02:43,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:02:43,449 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:02:43,450 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:02:43,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:02:43,453 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:02:43,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:43" (1/2) ... [2022-09-29 15:02:43,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d0fa5c1 and model type count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:02:43, skipping insertion in model container [2022-09-29 15:02:43,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:02:43,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "count0-countEven-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:02:43" (2/2) ... [2022-09-29 15:02:43,456 INFO L322 chiAutomizerObserver]: Analyzing ICFG count0-countEven-sample-abs.bpl [2022-09-29 15:02:43,524 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-29 15:02:43,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 112 flow [2022-09-29 15:02:43,587 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:02:43,587 INFO L123 PetriNetUnfolderBase]: 5/35 cut-off events. [2022-09-29 15:02:43,587 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 15:02:43,591 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. [2022-09-29 15:02:43,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 112 flow [2022-09-29 15:02:43,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 35 transitions, 88 flow [2022-09-29 15:02:43,612 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:02:43,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 88 flow [2022-09-29 15:02:43,643 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 88 flow [2022-09-29 15:02:43,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 88 flow [2022-09-29 15:02:43,656 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:02:43,656 INFO L123 PetriNetUnfolderBase]: 5/35 cut-off events. [2022-09-29 15:02:43,656 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 15:02:43,658 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. [2022-09-29 15:02:43,659 INFO L116 LiptonReduction]: Number of co-enabled transitions 666 [2022-09-29 15:02:44,172 INFO L131 LiptonReduction]: Checked pairs total: 531 [2022-09-29 15:02:44,173 INFO L133 LiptonReduction]: Total number of compositions: 21 [2022-09-29 15:02:44,184 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:02:44,184 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:02:44,184 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:02:44,184 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:02:44,185 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:02:44,185 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:02:44,185 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:02:44,185 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 15:02:44,186 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 28 places, 18 transitions, 54 flow [2022-09-29 15:02:44,189 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 28 places, 18 transitions, 54 flow [2022-09-29 15:02:44,191 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:44,191 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:44,191 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:02:44,191 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:02:44,191 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:44,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:02:44,194 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 28 places, 18 transitions, 54 flow [2022-09-29 15:02:44,196 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 28 places, 18 transitions, 54 flow [2022-09-29 15:02:44,197 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:44,197 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:44,197 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:02:44,197 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:02:44,197 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:44,202 INFO L733 eck$LassoCheckResult]: Stem: 51#[ULTIMATE.startENTRY]true [118] ULTIMATE.startENTRY-->countZeroENTRY: 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#[countZeroENTRY, L76]true [139] countZeroENTRY-->L32-1: Formula: (and (= v_cntZero_18 0) (= v_countZeroThread1of1ForFork0_i1_29 0)) InVars {} OutVars{cntZero=v_cntZero_18, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_29} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1] 55#[L32-1, L76]true [2022-09-29 15:02:44,203 INFO L735 eck$LassoCheckResult]: Loop: 55#[L32-1, L76]true [150] L32-1-->L32-1: Formula: (let ((.cse0 (= v_countZeroThread1of1ForFork0_i1_Out_2 (+ v_countZeroThread1of1ForFork0_i1_In_1 1))) (.cse2 (= (select v_A_In_3 v_countZeroThread1of1ForFork0_i1_In_1) 0)) (.cse1 (< v_countZeroThread1of1ForFork0_i1_In_1 v_N_In_3))) (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 .cse2 .cse1))) InVars {A=v_A_In_3, N=v_N_In_3, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_In_1, cntZero=v_cntZero_In_1} OutVars{A=v_A_In_3, N=v_N_In_3, countZeroThread1of1ForFork0_i1=v_countZeroThread1of1ForFork0_i1_Out_2, cntZero=v_cntZero_Out_2} AuxVars[] AssignedVars[cntZero, countZeroThread1of1ForFork0_i1] 55#[L32-1, L76]true [2022-09-29 15:02:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 4758, now seen corresponding path program 1 times [2022-09-29 15:02:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:44,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784473344] [2022-09-29 15:02:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash 181, now seen corresponding path program 1 times [2022-09-29 15:02:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:44,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065243534] [2022-09-29 15:02:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 147648, now seen corresponding path program 1 times [2022-09-29 15:02:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:44,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835293093] [2022-09-29 15:02:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,328 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:44,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:44,474 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:02:44,475 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:02:44,475 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:02:44,475 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:02:44,475 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:02:44,475 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:44,475 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:02:44,475 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:02:44,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:02:44,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:02:44,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:02:44,521 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:44,531 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:44,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:02:44,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:02:44,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:44,703 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) [2022-09-29 15:02:44,710 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 [2022-09-29 15:02:44,711 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 [2022-09-29 15:02:44,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:44,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:44,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:44,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:44,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:02:44,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:02:44,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:02:44,769 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 [2022-09-29 15:02:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:44,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:44,771 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) [2022-09-29 15:02:44,776 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 [2022-09-29 15:02:44,777 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 [2022-09-29 15:02:44,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:44,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:44,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:44,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:44,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:02:44,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:02:44,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:02:44,832 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:02:44,833 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:02:44,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:44,859 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) [2022-09-29 15:02:44,918 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:02:44,924 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 [2022-09-29 15:02:44,940 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:02:44,941 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:02:44,941 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, countZeroThread1of1ForFork0_i1) = 1*N - 1*countZeroThread1of1ForFork0_i1 Supporting invariants [] [2022-09-29 15:02:44,981 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 [2022-09-29 15:02:44,983 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:02:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:45,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:02:45,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:45,034 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:02:45,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:02:45,075 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 [2022-09-29 15:02:45,078 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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) [2022-09-29 15:02:45,294 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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) Result 6 states and 556 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:02:45,295 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:02:45,299 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:02:45,304 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 [2022-09-29 15:02:45,309 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) [2022-09-29 15:02:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-09-29 15:02:45,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 2 letters. Loop has 1 letters. [2022-09-29 15:02:45,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:45,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:02:45,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:45,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 186 transitions. Stem has 2 letters. Loop has 2 letters. [2022-09-29 15:02:45,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:45,316 INFO L428 stractBuchiCegarLoop]: Abstraction has has 40 places, 302 transitions, 1514 flow [2022-09-29 15:02:45,317 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:02:45,317 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 40 places, 302 transitions, 1514 flow [2022-09-29 15:02:45,322 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 40 places, 302 transitions, 1514 flow [2022-09-29 15:02:45,324 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:45,326 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 40 places, 302 transitions, 1514 flow [2022-09-29 15:02:45,330 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:45,330 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:45,330 INFO L123 PetriNetUnfolderBase]: 4/11 cut-off events. [2022-09-29 15:02:45,330 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 15:02:45,330 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:45,331 INFO L733 eck$LassoCheckResult]: Stem: 51#[ULTIMATE.startENTRY]true [118] ULTIMATE.startENTRY-->countZeroENTRY: 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#[countZeroENTRY, L76]true [121] L76-->countEvenENTRY: 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] 101#[countEvenENTRY, countZeroENTRY, L77]true [140] countEvenENTRY-->L48-1: Formula: (and (= v_countEvenThread1of1ForFork1_i2_25 0) (= v_cntEven_21 0)) InVars {} OutVars{cntEven=v_cntEven_21, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_25} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2] 103#[countZeroENTRY, L77, L48-1]true [2022-09-29 15:02:45,331 INFO L735 eck$LassoCheckResult]: Loop: 103#[countZeroENTRY, L77, L48-1]true [149] L48-1-->L48-1: Formula: (let ((.cse0 ((_ divisible 2) (select v_A_In_1 v_countEvenThread1of1ForFork1_i2_In_1))) (.cse1 (< v_countEvenThread1of1ForFork1_i2_In_1 v_N_In_1)) (.cse2 (= (+ v_countEvenThread1of1ForFork1_i2_In_1 1) v_countEvenThread1of1ForFork1_i2_Out_2))) (or (and (= v_cntEven_In_1 v_cntEven_Out_2) (not .cse0) .cse1 .cse2) (and .cse0 (= v_cntEven_Out_2 (+ v_cntEven_In_1 1)) .cse1 .cse2))) InVars {A=v_A_In_1, cntEven=v_cntEven_In_1, N=v_N_In_1, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_In_1} OutVars{A=v_A_In_1, cntEven=v_cntEven_Out_2, N=v_N_In_1, countEvenThread1of1ForFork1_i2=v_countEvenThread1of1ForFork1_i2_Out_2} AuxVars[] AssignedVars[cntEven, countEvenThread1of1ForFork1_i2] 103#[countZeroENTRY, L77, L48-1]true [2022-09-29 15:02:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 147080, now seen corresponding path program 1 times [2022-09-29 15:02:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:45,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501912103] [2022-09-29 15:02:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2022-09-29 15:02:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377707021] [2022-09-29 15:02:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash 4559629, now seen corresponding path program 1 times [2022-09-29 15:02:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929627466] [2022-09-29 15:02:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:45,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:45,514 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:02:45,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:02:45,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:02:45,515 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:02:45,515 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:02:45,515 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:45,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:02:45,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:02:45,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: count0-countEven-sample-abs.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:02:45,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:02:45,515 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:02:45,517 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:45,521 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:45,523 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:45,526 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:02:45,562 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:600) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:893) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:804) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:254) 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-09-29 15:02:45,671 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:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:893) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:804) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:254) 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-09-29 15:02:45,675 INFO L158 Benchmark]: Toolchain (without parser) took 2493.67ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 145.2MB in the end (delta: -8.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-09-29 15:02:45,676 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:02:45,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 177.2MB. Free memory was 136.9MB in the beginning and 135.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:02:45,679 INFO L158 Benchmark]: Boogie Preprocessor took 20.43ms. Allocated memory is still 177.2MB. Free memory was 135.3MB in the beginning and 134.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:02:45,683 INFO L158 Benchmark]: RCFGBuilder took 216.90ms. Allocated memory is still 177.2MB. Free memory was 134.1MB in the beginning and 124.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-09-29 15:02:45,684 INFO L158 Benchmark]: BuchiAutomizer took 2224.34ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 124.6MB in the beginning and 145.2MB in the end (delta: -20.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-09-29 15:02:45,688 INFO L339 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.12ms. Allocated memory is still 177.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 177.2MB. Free memory was 136.9MB in the beginning and 135.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.43ms. Allocated memory is still 177.2MB. Free memory was 135.3MB in the beginning and 134.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.90ms. Allocated memory is still 177.2MB. Free memory was 134.1MB in the beginning and 124.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2224.34ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 124.6MB in the beginning and 145.2MB in the end (delta: -20.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 43 PlacesBefore, 28 PlacesAfterwards, 35 TransitionsBefore, 18 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 531 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 462, positive: 457, positive conditional: 0, positive unconditional: 457, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 351, positive: 346, positive conditional: 0, positive unconditional: 346, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 351, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 462, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 351, unknown conditional: 0, unknown unconditional: 351] , 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 - 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:607) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-29 15:02:45,721 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 [2022-09-29 15:02:45,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...